Educational Codeforces Round 21 808B Average Sleep Time

Educational Codeforces Round 21 808B Average Sleep Time

B. Average Sleep Time

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!

When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more specifically, the average amount of hours of sleep per week). Luckily, Polycarp kept records of sleep times for the last n days. So now he has a sequence a₁, a₂, ..., a_n, where a_i is the sleep time on the i-th day.

The number of records is so large that Polycarp is unable to calculate the average value by himself. Thus he is asking you to help him with the calculations. To get the average Polycarp is going to consider k consecutive days as a week. So there will be n - k + 1 weeks to take into consideration. For example, if k = 2, n = 3 and a = [3, 4, 7], then the result is .

You should write a program which will calculate average sleep times of Polycarp over all weeks.

Input

The first line contains two integer numbers n and k (1 ≤ k ≤ n ≤ 2·10⁵).

The second line contains n integer numbers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁵).

Output

Output average sleeping time over all weeks.

The answer is considered to be correct if its absolute or relative error does not exceed 10^- 6. In particular, it is enough to output real number with at least 6 digits after the decimal point.

Examples

input

3 2
3 4 7

output

9.0000000000

题解：分别计算每个数对答案的贡献次数

#include <stdio.h>
#include <bits/stdc++.h>
#define mod 1000000007
typedef long long ll;
using namespace std;
ll n,k;
double avg;
ll ans;
ll s[200005];
int main(){ 
	cin>>n>>k;
	for(int i=1;i<=n;i++) scanf("%I64d",s+i);
	ll c=0;
	for(int i=1;i<=n;i++){
		if(i<=n-k+1){
			if(c<k) c++;
			ans+=c*s[i];
		}else{
			if(c>n-i+1) c--;
			ans+=c*s[i];
		}
	}
	avg=ans*1.0/(n-k+1);
	printf("%0.12lf",avg);
    return 0;
}