Intense Heat （ CodeForces - 1003C）（连续k个（到n个）最大平均值）

                                                        Intense Heat

                                                                      time limit per test 4 seconds

                                                               memory limit per test 256 megabytes

                                                                            input standard input

                                                                          output standard output

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 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 x to day y, we calculate it as y∑i=xaiy−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] 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≤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 a1, a2, ..., an (1≤ai≤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 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.

Example

input

4 3
3 4 1 2

output

2.666666666666667

题解

题目的大致意思是：n个数，至少选k个（必须连续选），求均值最大为多少

从k个开始遍历，到n，相同长度找到和最大的情况，取平均值，再与其他长度的最大和的平均值比较

注意长度和起点和终点怎样表示，细节一定要看好，忌浮躁，一浮躁就game over。。。所以我要去看炮姐，平复一下心情。（我要再说十遍！炮姐超帅！）

# include <cstdio>
# include <algorithm>
# include <cstring>

using namespace std;
const int maxn = 5000 + 10;

int main()
{
	int n, k;
	int a[maxn];
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++) scanf("%d",&a[i]);
	
	int sum = 0;
	int maxs = 0;
	double maxa = 0;
	for(int i=k;i<=n;i++)
	{
		for(int j=0;j<i;j++) sum += a[j];
		
		maxs = sum;
		for(int j=1;j<n-i+1;j++)
		{
			sum = sum-a[j-1]+a[j+i-1];
			maxs = max(maxs,sum);
		}
		double a = maxs*1.0/i;
		maxa = max(maxa,a);
		sum = 0;
	}
	printf("%lf\n",maxa);
	return 0;
 }