Pagini recente » Cod sursa (job #2720180) | Clasament ojipreg | Cod sursa (job #2524265) | Cod sursa (job #368279) | Cod sursa (job #1515796)
#include <cstdio>
using namespace std;
int N;
int s, x, max;
int p1, p2, st;
int main() {
int i, j;
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &N);
scanf("%d", &x);
max = s = x;
p1 = p2 = st = 1;
for(i = 2; i <= N; i++) {
scanf("%d", &x);
s += x;
if(s < x) {
s = x;
st = i;
}
if(s > max) {
max = s;
p1 = st;
p2 = i;
}
}
printf("%d %d %d\n", max, p1, p2);
return 0;
}