Cod sursa(job #588901)
| Utilizator | Data | 9 mai 2011 22:28:58 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
# include <cstdio>
#define nmax 6000005
using namespace std;
int i, n, s, bestSum, sum, beg, end, idx;;
int main(void){
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d", &n);
bestSum = -int(2e9); sum = 0;
for (i = 1; i <= n; ++i){
scanf("%d", &s);
if (sum < 0) sum = s, idx = i;
else sum += s;
if (bestSum < sum ) bestSum = sum, beg = idx, end = i;
}
printf("%d %d %d\n", bestSum, beg, end);
return 0 ;
}
