Cod sursa(job #477756)
Utilizator | Simoiu Robert SpiderMan | Data | 16 august 2010 11:41:31 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
# include <fstream>
using namespace std ;
const char FIN[] = "ssm.in", FOU[] = "ssm.out" ;
const int oo = 2147483647 ;
int N ;
int main ( void ) {
ifstream f ( FIN ) ;
ofstream g ( FOU ) ;
f >> N ;
int rez = -oo, min = 0, poz = 0, st = 0, dr = 0;
for ( int i = 1, x = 0, y = 0; i <= N; ++i, x = y ) {
f >> y , y += x ;
if ( rez < y - min ) {
rez = y - min, st = poz + 1, dr = i;
}
if ( min > y ) {
min = y, poz = i;
}
}
g << rez << " " << st << " " << dr ;
return 0;
}