Pagini recente » Cod sursa (job #2261315) | Cod sursa (job #1102845) | Cod sursa (job #2987648) | Cod sursa (job #742499) | Cod sursa (job #922113)
Cod sursa(job #922113)
#include<cstdio>
using namespace std;
#define MAX 30001
int N ,L ,U , c[MAX] , t[MAX] , sum , ti ;
float maxx;
void citire();
void solve();
void tipar();
int main()
{
citire();
solve();
tipar();
return 0;
}
void citire()
{
freopen("secv3.in" , "r" , stdin );
scanf("%d%d%d" , &N , &L , &U);
for( int i = 1 ; i <= N ; ++i )
scanf("%d" , &c[i]);
for(int i = 1 ; i <= N ; ++i)
scanf("%d" , &t[i]);
}
void solve()
{
int j = 1;
for(int i = 1 ; i <= L ; ++i)
{
sum+=c[i];
ti+=t[i];
}
for(int i = L+1 ; i <= N ; ++i)
{
sum+=c[i];
ti+=t[i];
if(i-j+1>U)
{
sum-=c[j];
ti-=t[j++];
}
while((float)(sum/ti) < (float)(sum-c[j])/(ti-t[j]) && i-j+1 > L)
{
sum-=c[j];
ti-=t[j++];
}
if((float)sum/ti > maxx)
maxx = (float)sum/ti;
}
}
void tipar()
{
freopen("secv3.out" , "w" , stdout);
printf("%f" , maxx);
}