Cod sursa(job #561939)
Utilizator | Ciucanu Codrin codrut94 | Data | 21 martie 2011 23:24:30 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
# include <cstdio>
using namespace std;
int i , n , sf , x , inc;
int y = 1 , s = 0 , best = -219999999;
int main()
{ freopen ( "ssm.in" , "rt" , stdin );
freopen ( "ssm.out" , "wt" , stdout);
scanf ( "%d" , &n );
sf = n;
for( i = 1 ; i <= n ; i++ )
{ scanf ( "%d" , &x );
if ( s < 0 ) s = x, y = i;
else s+= x;
if( best < s ) best = s , inc = y , sf = i;
}
printf ( "%d %d %d\n" , best , inc , sf );
return 0;
}