Mai intai trebuie sa te autentifici.
Cod sursa(job #1005106)
| Utilizator | Data | 4 octombrie 2013 10:11:55 | |
|---|---|---|---|
| Problema | Secventa 3 | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include<fstream>
#include<iomanip>
using namespace std;
#define max_n 30010
ifstream f("secv3.in");
ofstream g("secv3.out");
int n , l , u;
int V[max_n] , T[max_n];
void read(){
f>>n>>l>>u;
for( int i = 1 ; i <= n ; i++ )
{
f>>V[i];
V[i] += V[i-1];
}
for( int i = 1 ; i <= n ; i++ ){
f>>T[i];
T[i] += T[i-1];
}
}
int main(){
read();
double fract , maxim = -2;
for( int j , i = 1 ; i <= n ; i++ ){
for( j = l - 1 ; j < u && (i+j) <= n ; j++ ){
fract = ((double)V[j+i] - V[i - 1]) / ((double)T[j+i] - T[i-1]);
if( fract > maxim )
maxim = fract;
}
}
g<<fixed<<setprecision(2)<<maxim<<"\n";
return 0;
}
