Pagini recente » Cod sursa (job #2076978) | Cod sursa (job #1516728) | Cod sursa (job #1963213) | Cod sursa (job #1897263) | Cod sursa (job #1533650)
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("secv3.in");
ofstream g("secv3.out");
double r[9000000],c[30000],t[30000];
int main()
{
double nr1,nr2;
int n,l,u,wu,j=1;
f>>n>>u>>l;
for(int i=1;i<=n;i++)
f>>c[i];
for(int i=1;i<=n;i++)
f>>t[i];
for(int i=1;i<=n;i++)
{
wu=u;
while(wu<=l && wu+i<=n+1)
{
nr1=0;
nr2=0;
for(int k=i;k<=i+wu-1;k++)
{
nr1=nr1+c[k];
nr2=nr2+t[k];
}
r[j]=nr1/nr2;
j++;
wu++;
}
}
sort(r,r+60);
g<<r[60-1];
return 0;
}