Pagini recente » Cod sursa (job #1543118) | Cod sursa (job #2231831) | Cod sursa (job #1698666) | Cod sursa (job #2155608) | Cod sursa (job #96122)
Cod sursa(job #96122)
#include<fstream.h>
#include<iomanip.h>
#define dim 50001
int v[2][dim];
int main()
{ifstream f("secv3.in");
ofstream g("secv3.out");
int n,l,i,j,n1,n2,u;
//long max=0,man1,man2,man;
unsigned long max1=1,max2=1,man1,man2;
long double max;
f>>n>>l>>u;
for(i=1;i<=n;i++)
{f>>v[0][i];
v[0][i]=v[0][i]+v[0][i-1];
}
for(i=1;i<=n;i++)
{f>>v[1][i];
v[1][i]=v[1][i]+v[1][i-1];
}
for(i=1;i<=n;i++)
{n1=i-u;
n2=i-l;
for(j=n1;j<=n2;j++)
if(j>=0.0)
{man1=v[0][i]-v[0][j];
man2=v[1][i]-v[1][j];
//if(man2)
//{man=man1/man2;
//if(man>max)
//max=man;
//}
if((man1*max2)>(man2*max1))
{max1=man1;
max2=man2;
}
//if(man1>max1)
// {max1=man1;
// max2=man2;
// }
}
}
f.close();
max1*=1000;
max=max1/max2;
max=max/1000;
// g<<setprecision(2)<<((long double)max1/max2)<<'\n';
g<<setprecision(2)<<max<<'\n';
g.close();
return 0;
}
/* for(i=1;i<=n1;i++)//nu de la 0
{n2=i+u-1;//+(-1)
if(n2>n) n2=n;
for(j=(i+l-1);(j<=n2);j++)//nu de la i+l;
{man1=v[0][j]-v[0][i];
man2=v[1][j]-v[1][i];
if(man2)
{man=man1/man2;
if(man>max)
max=man;
}
}
}
*/