Pagini recente » Cod sursa (job #1597109) | Cod sursa (job #2413561) | Cod sursa (job #2878616) | Cod sursa (job #198702) | Cod sursa (job #614261)
Cod sursa(job #614261)
#include <cstdio>
double a[30001],c[30001],p[30001],t[30001];
inline int min(int x,int y){if (x<y) return x;else return y;}
int main()
{
double max=0;
int n,l,u,i,j;
freopen("secv3.in","r",stdin);
freopen("secv3.out","w",stdout);
scanf("%d %d %d\n",&n,&u,&l);
for (j=1;j<=n;++j)
scanf("%lf",&c[j]);
for (i=1;i<=n;++i)
p[i]=p[i-1]+c[i];
for (i=1;i<=n;++i)
scanf("%lf",&a[i]);
for (i=1;i<=n;++i)
t[i]=t[i-1]+a[i];
for (i=1;i<=n-u+1;++i)
for (j=i+u-1;j<=n&&j<=i+l-1&&j<=i+u+1000;++j)
if (p[j]-p[i-1]>max*(t[j]-t[i-1]))
max=(p[j]-p[i-1])/(t[j]-t[i-1]);
printf("%.2lf",max);
return 0;
}