Pagini recente » Cod sursa (job #2197017) | Cod sursa (job #3265734) | Cod sursa (job #1182601) | Cod sursa (job #3132722) | Cod sursa (job #1759041)
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv3.in");
ofstream g("secv3.out");
int n,l,u,i,j,sf;
double maxi,a[1<<15],c[1<<15],p[1<<15],t[1<<15];
int main()
{
f>>n>>u>>l;
for(i=1;i<=n;++i)
{
f>>c[i];
p[i]=p[i-1]+c[i];
}
for(i=1;i<=n;++i)
{
f>>a[i];
t[i]=t[i-1]+a[i];
}
for(i=1;i<=n-u+1;++i)
for(j=i+u-1,sf=min(n,i+min(l-1,u+1000));j<=sf;++j)
if(p[j]-p[i-1]>maxi*(t[j]-t[i-1]))
maxi=(p[j]-p[i-1])/(t[j]-t[i-1]);
g<<fixed<<setprecision(2)<<maxi;
return 0;
}