Pagini recente » Cod sursa (job #2613093) | Cod sursa (job #705692) | Cod sursa (job #934819) | Cod sursa (job #1572819) | Cod sursa (job #2208634)
#include <bits/stdc++.h>
using namespace std;
double spc[30009],smax,spt[30009];
int main()
{
ifstream fin ("secv3.in");
ofstream fout ("secv3.out");
int n,l,u;
fin>>n>>l>>u;
for (int i=1;i<=n;++i)
{
double cost;
fin>>cost;
spc[i]=spc[i-1]+cost;
}
for (int i=1;i<=n;++i)
{
double timp;
fin>>timp;
spt[i]=spt[i-1]+timp;
}
//cout<<spt[5]<<" "<<spt[4]<<"\n";
for (int i=1;i<=n-l+1;++i)
{
for (int j=l;j<=u;++j)
{
double cost;
double timp;
if (i+j-1<=n)
{
cost=spc[i+j-1]-spc[i-1];
timp=spt[i+j-1]-spt[i-1];
smax=max(smax,(cost/timp));
//cout<<cost<<" "<<timp<<" "<<i-j+1<<" "<<i-1<<"\n";
}
}
}
fout<<<<smax;
}