Pagini recente » Cod sursa (job #2362697) | Cod sursa (job #1023198) | Istoria paginii runda/tema1 | Cod sursa (job #1842212) | Cod sursa (job #1768212)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,l,u,c[30000],t[300000],i,j;
float maxi=0;
ifstream f("secv3.in");
ofstream g("secv3.out");
f>>n>>l>>u;
for(i=1;i<=n;i++)
f>>c[i];
for(i=1;i<=n;i++)
f>>t[i];
int sumt,sumc;
while(l<=u)
{
j=i=1;
sumc=sumt=0;
if(l!=1){
while(j<=n)
{
sumt+=t[j];
sumc+=c[j];
if(i==l){
i=1;
if((float)sumc/sumt>maxi)
maxi=(float)sumc/sumt;
sumt=sumc=0;
}
else
{
j++;
i++;
}
}
}
else
for(int m=1;m<=n;m++)
if((float)c[m]/t[m]>maxi)
maxi=(float)c[m]/t[m];
l++;
}
g<<maxi;
return 0;
}