Pagini recente » Cod sursa (job #2443254) | Cod sursa (job #1155956) | Cod sursa (job #405689) | Cod sursa (job #476986) | Cod sursa (job #2266513)
#include <iostream>
#include <cstdio>
#include <deque>
#define N 30001
using namespace std;
int n, lmin, lmax, c[N], t[N];
double maxi=0;
//deque <double> q;
int main()
{
freopen("secv3.in", "r", stdin);
freopen("secv3.out", "w", stdout);
scanf("%d %d %d\n", &n, &lmin, &lmax);
for(int i=0;i<n;i++)
{
scanf("%d ", &c[i]);
c[i]+=c[i-1];
}
for(int i=0;i<n;i++)
{
scanf("%d ", &t[i]);
t[i]+=t[i-1];
}
for(int l=lmin;l<=lmax;l++)
{
for(int i=0;i<n-l;i++)
{
double s=(c[i+l]-c[i])*1.0/(t[i+l]-t[i]);
if(maxi<s)
maxi=s;
}
}
printf("%.2llf", maxi);
return 0;
}