forked from mpfeifer1/Kattis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprosjek2.cpp
57 lines (48 loc) · 1023 Bytes
/
prosjek2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
ld eps = .00001;
vector<ld> arr;
bool works(int len, ld avg) {
vector<ld> temp;
for(auto& i : arr) {
temp.push_back(i - avg);
}
vector<ld> prefix;
prefix.push_back(0);
for(int i = 0; i < temp.size(); i++) {
prefix.push_back(temp[i] + prefix.back());
}
bool good = false;
ld minpref = prefix[0];
for(int i = len; i < prefix.size(); i++) {
minpref = min(prefix[i-len], minpref);
if(prefix[i] - minpref >= 0) {
good = true;
break;
}
}
return good;
}
int main() {
int n, k;
cin >> n >> k;
arr.resize(n);
for(auto& i : arr) {
cin >> i;
}
ld lo = 0;
ld hi = 1000001;
while(hi - lo > eps) {
ld mi = (hi + lo) / 2;
if(works(k,mi)) {
lo = mi;
}
else {
hi = mi;
}
}
cout << fixed;
cout.precision(6);
cout << lo << endl;
}