Pagini recente » Cod sursa (job #859491) | Cod sursa (job #2937623) | Cod sursa (job #2408067) | Cod sursa (job #1257512) | Cod sursa (job #2519822)
#include <bits/stdc++.h>
std::ifstream fin("secv3.in");
std::ofstream fout("secv3.out");
typedef long long ll;
ll n, u, l, sc, st;
double sol;
std::pair<ll, ll> list[30005];
int main()
{
fin>>n>>l>>u;
for(int i=1; i<=n; ++i) fin>>list[i].first;
for(int i=1; i<=n; ++i) fin>>list[i].second;
for(int i=1; i<=n; ++i){
sc=st=0;
for(int j=i; j>=std::max(1LL, i-u+1); --j){
sc+=list[i].first;
st+=list[i].second;
if(j<=i-l+1 && 1.0*sc/st>sol) sol=1.0*sc/st;
}
}
fout<<sol;
return 0;
}