『ACM C++』 Codeforces | 1003C - Intense Heat

今日兴趣新闻：

nasa 研制最强推进器，加速度可达每秒 40 公里，飞火星全靠它

链接：https://mbd.baidu.com/newspage/data/landingsuper?context=%7b"nid"%3a"news_11707429683828231737"%7d&n_type=0&p_from=1

 

 

------------------------------------------------题目----------------------------------------------------------

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 nn consecutive days. we have measured the temperatures during these nn days; the temperature during ii-th day equals aiai.

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 xx to day yy, we calculate it as ∑i=xyaiy−x+1∑i=xyaiy−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 kkconsecutive days. for example, if analyzing the measures [3,4,1,2][3,4,1,2] and k=3k=3, we are interested in segments [3,4,1][3,4,1], [4,1,2][4,1,2] and [3,4,1,2][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 nn and kk (1≤k≤n≤50001≤k≤n≤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 nn integers a1a1, a2a2, ..., anan (1≤ai≤50001≤ai≤5000) — the temperature measures during given nn days.

output

print one real number — the heat intensity value, i. e., the maximum of average temperatures over all segments of not less than kkconsecutive days.

your answer will be considered correct if the following condition holds: |res−res0|<10−6|res−res0|<10−6, where resres is your answer, and res0res0 is the answer given by the jury's solution.

input

4 3
3 4 1 2

output

2.666666666666667

------------------------------------------------题目----------------------------------------------------------

 

（一） 题目分析：

　　　　正常div3难度题型，难度处理可能是在求和统计上，题目大概含义就是：

　　　　求n个数中至少连续k个数的平均值的最大值，如：n=4,k=3   给定的n个数是3 4 1 2，则求[3,4,1],[4,1,2],[3,4,1,2]三个区间的平均值的最大值。

　　　　我用的方法比较简单，就是简单的取值求和，今天下午打完题之后这道题还特地搜了一下，发现还有其他的解法：前缀和 /  尺缩

 

（二）ac代码：

　　　　因为代码比较简单，依旧不分块了~

#include<stdio.h>
#define max(a,b) (a>b) ? a : b
using namespace std;
int n,k,sum;
int temp[5001];
double ans,all;
int main()
{
    scanf("%d%d",&n,&k);
    ans = 0;
    for(int i = 1;i<=n;i++) scanf("%d",&temp[i]);

    for(int i = 1;i<=n;++i)
    {
        sum = 0;
        for(int j = i;j<=n;++j)
        {
            sum+= temp[j];
            if (j - i + 1 >= k) 
            {
                all = sum * 1.0 / (j - i + 1);
                if(all>ans) ans = all;
            }
        }
    }
    printf("%.15f\n",ans);
    return 0;
}

 

（三）ac截图：

 

 

（四）解后分析：

　　贡献一个队内牛逼师兄高效率的代码：

　　备注一下：前缀和