Pagini recente » Cod sursa (job #130306) | Cod sursa (job #1177078) | Cod sursa (job #251135) | Cod sursa (job #1666073) | Cod sursa (job #1538883)
#include <stdio.h>
#include <stdlib.h>
#define MN 6000002
int S[MN];
int main() {
int i, minj, N, best, besti, min;
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &N);
for(i = 1; i <= N; i++) {
scanf("%d", S + i);
S[i] += S[i-1];
}
minj = 1;
min = 0;
best = S[1];
besti = 1;
for(i = 1; i <= N; i++) {
if (best < S[i] - min) {
best = S[i] - min, besti = i;
}
if (min > S[i]) {
min = S[i], minj = i + 1;
}
}
printf("%d %d %d\n", best, minj, besti);
return 0;
}