n,k=input().split()
work=list(map(int,input().split()))
l=[0]+work
summ=0
big=0
x=1
y=0
while y<int(n)+1:
if y==int(k):
summ+=l[y]
big+=summ
y+=1
elif y<int(k):
summ+=l[y]
y+=1
else:
summ-=l[x]
x+=1
summ+=l[y]
y+=1
big+=summ
print(big/(int(n)-int(k)+1))
// || जय जय जय बजरंग बली ||
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n,k;
cin >> n >> k;
vector<double> vc(n);
for(int i=0; i<n; i++) {
cin >> vc[i];
}
int i=0;
double ans = 0.0;
double mx = 0.0;
while(i < k) {
ans += vc[i];
i++;
}
int j=0;
mx += ans;
while(i < n) {
ans = (ans + vc[i] - vc[j]);
mx += ans;
i++;
j++;
}
double deno = (double)(n - k + 1.0);
cout << fixed << setprecision(10) << mx/deno;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc = 1;
//cin >> tc;
while(tc--) {
solve();
}
return 0;
}
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |