Pagini recente » Cod sursa (job #1494632) | Cod sursa (job #2399161) | Cod sursa (job #2766384) | Cod sursa (job #2716580) | Cod sursa (job #2895008)
#include <fstream>
#include <iomanip>
using namespace std;
ifstream f("secv3.in");
ofstream g("secv3.out");
int n,l,u,sf;
double Max,a[30002],c[30002],p[30002],t[30002];
int main()
{
f>>n>>u>>l;
for(int i=1; i<=n; i++)
{
f>>c[i];
p[i]=p[i-1]+c[i];
}
for(int i=1; i<=n; i++)
{
f>>a[i];
t[i]=t[i-1]+a[i];
}
for(int i=1; i<=n-u+1; i++)
{
for(int j=i+u-1,sf=min(n,i+min(l-1,u+1000)); j<=sf; j++)
{
if(p[j]-p[i-1]>Max*(t[j]-t[i-1]))
{
Max=(p[j]-p[i-1])/(t[j]-t[i-1]);
}
}
}
g<<fixed<<setprecision(2)<<Max<<"\n";
return 0;
}