Pagini recente » Cod sursa (job #597935) | Cod sursa (job #2717366) | Cod sursa (job #1178175) | Cod sursa (job #87814) | Cod sursa (job #2455170)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("secv3.in");
ofstream fout ("secv3.out");
int c[30005], t[30005];
double f[30005];
deque < int > dq;
int main()
{
ios::sync_with_stdio(false);
fin.tie(0);
int n, mn, mx;
fin >> n >> mn >> mx;
for(int i = 1; i <= n; ++i) fin >> c[i];
for(int i = 1; i <= n; ++i) fin >> t[i];
for(int i = 2; i <= n; ++i) {
c[i] = c[i - 1] + c[i];
t[i] = t[i - 1] + t[i];
}
double sol = 1.0 * c[mn] / t[mn];
int j = 1;
for(int i = mn + 1; i <= n; ++i) {
if(i - j == mx - 1) ++j;
double ans1 = 1.0 * (c[i] - c[j - 1]) / (t[i] - t[j - 1]);
double ans2 = 1.0 * (c[i] - c[j - mn]) / (t[i] - t[j - mn]);
if(ans2 > ans1)
j = i - mn + 1;
sol = max(sol, max(ans1, ans2));
}
fout << fixed << setprecision(10) << sol;
return 0;
}