Pagini recente » Cod sursa (job #2738428) | Cod sursa (job #10831) | Cod sursa (job #2385987) | Cod sursa (job #2565342) | Cod sursa (job #1767807)
#include <cstdio>
#include <algorithm>
using namespace std;
int sp[6000005];
int main()
{
int n, i, x, maxim = -2000000000, stt = 0, st = 0, dr = 0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d", &n);
for(i = 1;i <= n; ++i){
scanf("%d", &x);
sp[i] = sp[i - 1] + x;
if(maxim < sp[i] - sp[st]){
maxim = sp[i] - sp[st];
stt = st;
dr = i;
}
if(sp[i] < sp[st]){
st = i;
}
}
printf("%d %d %d\n", maxim, stt+1, dr);
return 0;
}