Pagini recente » Cod sursa (job #632590) | Cod sursa (job #2948675) | Cod sursa (job #1023010) | Cod sursa (job #1682222) | Cod sursa (job #1719877)
#include<cstdio>
using namespace std;
int n,l,u,v[30005],c[30005];
int main()
{
freopen("secv3.in","r",stdin);
freopen("secv3.out","w",stdout);
scanf("%d%d%d",&n,&l,&u);
for(int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
for(int i=1;i<=n;i++)
{
scanf("%d",&c[i]);
}
double maxim=0;
for(int i=l;i<=u;i++)
{
int n1=0;
int n2=0;
for(int j=1;j<=n;j++)
{
{
n1+=v[j];
n2+=c[j];
if (j>i)
{
n1-=v[j-i];
n2-=c[j-i];
}
double f=(n1*1.0)/n2;
if (f>maxim) maxim=f;
}
}
}
printf("%.2lf\n",maxim);
return 0;
}