Pagini recente » Cod sursa (job #44430) | Cod sursa (job #2303813) | Cod sursa (job #3285917) | Cod sursa (job #762519) | Cod sursa (job #1733185)
#include <cstdio>
#include <algorithm>
#include <deque>
#define MaxN 30001
#define INF 2000000000
#define time second
#define value first
using namespace std;
pair <int,int> v[MaxN];
int N,U,L;
float Max,S;
deque <int>D;
int main()
{
freopen("secv3.in","r",stdin);
freopen("secv3.out","w",stdout);
scanf("%d%d%d",&N,&L,&U);
v[0].value=v[0].time=0;
for(int i=1;i<=N;i++)
scanf("%d",&v[i].value),v[i].value+=v[i-1].value;
for(int i=1;i<=N;i++)
scanf("%d",&v[i].time),v[i].time+=v[i-1].time;
for(int i=L;i<=N;i++)
for(int j=i-L;j>=0&&j>=i-U;j--)
{
S=v[i].value-v[j].value;
S/=v[i].time-v[j].time;
Max=max(Max,S);
}
printf("%f",Max);
return 0;
}