Pagini recente » Cod sursa (job #780171) | Cod sursa (job #1775716) | Cod sursa (job #3158285) | Cod sursa (job #2028011) | Cod sursa (job #60354)
Cod sursa(job #60354)
#include <stdio.h>
#define NMAX 3010//0
int a[NMAX], b[NMAX];
int n, l, u;
double max;
void read()
{
int i;
scanf("%d %d %d\n", &n, &l, &u);
for(i = 1; i <= n; ++i)
{
scanf("%d", &a[i]);
}
for(i = 1; i <= n; ++i)
{
scanf("%d", &b[i]);
}
}
void solve()
{
int i, j;
int inc, sf;
double s1, s2;
s1 = s2 = 0;
for(i = 1; i <= l; ++i)
{
s1 += a[i];
s2 += b[i];
}
inc = 1;
sf = l;
max = s1 / s2;
while(sf <= n)
{
if(max < s1 / s2)
max = s1 / s2;
for(i = sf+1; i <= (sf + u - l - 1); ++i)
{
s1 += a[i];
s2 += b[i];
if(max < s1 / s2)
max = s1 / s2;
}
s1 -= a[inc];
s2 -= b[inc];
++inc, ++sf;
s1 += a[sf];
s2 += b[sf];
}
}
int main()
{
freopen("secv3.in", "r", stdin);
freopen("secv3.out", "w", stdout);
read();
solve();
printf("%.2lf\n", max);
fclose(stdin);
fclose(stdout);
return 0;
}