Cod sursa(job #2290273)
Utilizator | Nicola Victor Teodor Victoras2006 | Data | 26 noiembrie 2018 11:24:22 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
freopen( "ssm.in", "r", stdin );
freopen( "ssm.out", "w", stdout );
int n, a, sum, st, dr, smax, i, x, y;
scanf( "%d", &n );
smax = 1 << 31;
sum = 0;
x = 1;
for ( i = 0; i < n; i ++ ) {
scanf( "%d", &a );
if ( sum < 0 ) {
sum = a;
x = y = i + 1;
}
else {
sum += a;
y = i + 1;
}
if ( sum > smax ) {
smax = sum;
st = x;
dr = y;
}
}
printf( "%d %d %d\n", smax, st, dr );
return 0;
}