Cod sursa(job #2890954)
| Utilizator | Data | 17 aprilie 2022 04:11:28 | |
|---|---|---|---|
| Problema | Secventa 3 | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv3.in");
ofstream out("secv3.out");
int n, l, u;
double cost[30005], timp[30005], sus, jos, ans;
int main()
{
in>>n>>l>>u;
for (int i = 1; i <= n; i++)
in>>cost[i];
for (int i = 1; i <= n; i++)
in>>timp[i];
for (int i = 1; i <= n; i++) {
sus = 0;
jos = 0;
for (int j = i; j >= max(1, j - u + 1); j--) {
sus += cost[j];
jos += timp[j];
if (j - i + 1 >= l)
ans = max(ans, sus / jos);
}
}
out<<ans;
}
