Cod sursa(job #938211)
| Utilizator | Data | 12 aprilie 2013 01:05:35 | |
|---|---|---|---|
| Problema | Secventa 3 | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
#include<algorithm>
#define NMAX 30005
using namespace std;
ifstream fin("secv3.in");
ofstream fout("secv3.out");
int n,F,L;
double c[NMAX],t[NMAX],maxim;
int main()
{
fin>>n>>F>>L;
int x;
for(int i=1;i<=n;i++)
{
fin>>x;
c[i]=c[i-1]+x;
}
for(int i=1;i<=n;i++)
{
fin>>x;
t[i]=t[i-1]+x;
}
for(int i=F;i<=n;i++)
for(int j=i-F;j>=0 && i-j<=L;j--)
maxim=max(maxim,(c[i]-c[j])/(t[i]-t[j]));
fout<<maxim<<'\n';
fin.close();
fout.close();
return 0;
}
