Pagini recente » Cod sursa (job #2849201) | Cod sursa (job #122867) | Cod sursa (job #461288) | Cod sursa (job #1870067) | Cod sursa (job #2330288)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 30005;
int c[MAXN], t[MAXN], dq[MAXN];
int main()
{
ifstream fin("secv3.in");
ofstream fout("secv3.out");
int n, l, u;
fin >> n >> l >> u;
for(int i = 1; i <= n; ++i){
fin >> c[i];
c[i] += c[i - 1];
}
for(int i = 1; i <= n; ++i){
fin >> t[i];
t[i] += t[i - 1];
}
int st = 0, dr = 0;
double ans = 0.00;
for(int i = 1; i <= n; ++i){
while(dr >= st && dq[st] <= i - u)
st++;
if(i >= l){
ans = max(ans, 1.000 * (c[i] - c[i - l]) / (t[i] - t[i - l]));
dq[++dr] = i;
}
}
fout << fixed << setprecision(2) << ans;
return 0;
}