Intense Heat CodeForces - 1003C （前缀和）-CSDN博客

本文链接：https://blog.csdn.net/qq_41874469/article/details/80914921

本文介绍了一个计算连续几天中最高平均温度的问题，通过使用前缀和的方法优化了算法效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The heat during the last few days has been really intense. Scientists from all over the Berland study how the temperatures and weather change, and they claim that this summer is abnormally hot. But any scientific claim sounds a lot more reasonable if there are some numbers involved, so they have decided to actually calculate some value which would represent how high the temperatures are.

Mathematicians of Berland State University came up with a special heat intensity value. This value is calculated as follows:

Suppose we want to analyze the segment of $n$ consecutive days. We have measured the temperatures during these $n$ days; the temperature during $i$ -th day equals $a_{i}$ .

We denote the average temperature of a segment of some consecutive days as the arithmetic mean of the temperature measures during this segment of days. So, if we want to analyze the average temperature from day $x$ to day $y$ , we calculate it as $\frac{y \sum i = x a_{i}}{y - x + 1}$ (note that division is performed without any rounding). The heat intensity value is the maximum of average temperatures over all segments of not less than $k$ consecutive days. For example, if analyzing the measures $[3, 4, 1, 2]$ and $k = 3$ , we are interested in segments $[3, 4, 1]$ , $[4, 1, 2]$ and $[3, 4, 1, 2]$ (we want to find the maximum value of average temperature over these segments).

You have been hired by Berland State University to write a program that would compute the heat intensity value of a given period of days. Are you up to this task?

Input

The first line contains two integers $n$ and $k$ ( $1 \leq k \leq n \leq 5000$ ) — the number of days in the given period, and the minimum number of days in a segment we consider when calculating heat intensity value, respectively.

The second line contains $n$ integers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ ( $1 \leq a_{i} \leq 5000$ ) — the temperature measures during given $n$ days.

Output

Print one real number — the heat intensity value, i. e., the maximum of average temperatures over all segments of not less than $k$ consecutive days.

Your answer will be considered correct if the following condition holds: $| r e s - r e s_{0} | < 10^{- 6}$ , where $r e s$ is your answer, and $r e s_{0}$ is the answer given by the jury's solution.

       Example
      
         input
         
          Copy
         
4 3
3 4 1 2

         output
         
          Copy
         
2.666666666666667

题意：给出长为n的数列，表示有连续的n天，每天的温度为ai，现在，定义平均热度为∑i=xyaiy−x+1

x，y表示任意从x天开始，到y天结束。k表是最短的连续天数，即y-x+1>=k。数列可能有多个平均热度，求出最大的平均热度

思路：如果直接暴力直接枚举所有的情况的话是5000的立方，所以考虑用前缀和来做，先处理出前i天的温度和。

#include "iostream"
#include "cstring"
#include "algorithm"
using namespace std;
#define esp 1e-6
int n,k,a[5005];
int main(){
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]+=a[i-1];
    double ans=0;
    for(int i=0;i<=n;i++)
        for(int j=i+k;j<=n;j++)
            ans=(1.0*(a[j]-a[i])/(j-i))-ans>esp?(1.0*(a[j]-a[i])/(j-i)):ans;
    printf("%.15lf",ans);
    return 0;
}