Pagini recente » Cod sursa (job #1129150) | Cod sursa (job #2221879) | Cod sursa (job #2903056)
#include <stdio.h>
#include <stdlib.h>
int x[100001],y[100001];
int deq[100001];
int main()
{
int n,l,u,i,p,a,b,j;
double max;
freopen("secv3.in","r",stdin);
freopen("secv3.out","w",stdout);
scanf("%d%d%d",&n,&l,&u);
for(i=1; i<=n; i++)
scanf("%d",&x[i]);
for(i=1; i<=n; i++)
scanf("%d",&y[i]);
for(i=1; i<=n; i++)
x[i]=x[i-1]+x[i];
for(i=1; i<=n; i++)
y[i]=y[i-1]+y[i];
max=(double)x[l]/y[l];
deq[a=b=1]=1;
for(j=l+1; j<=n; j++)
{
while(a<=b && deq[a]<=j-u)
a++;
while(b>=a && (double)(x[j]-x[deq[b]-1])/(y[j]-y[deq[b]-1])<(double)(x[j]-x[j-l])/(y[j]-y[j-l]))
b--;
deq[++b]=j-l+1;
if(max<(double)(x[j]-x[deq[a]-1])/(y[j]-y[deq[a]-1]))
max=(double)(x[j]-x[deq[a]-1])/(y[j]-y[deq[a]-1]);
}
printf("%.2lf\n",max);
return 0;
}