Pagini recente » Cod sursa (job #3262237) | Cod sursa (job #2948225) | Cod sursa (job #1102516) | Cod sursa (job #1862651) | Cod sursa (job #2766587)
#include <iostream>
using namespace std;
int n, a[6000000], stcur, stmax=0, drmax=0;
long long ans = a[0], cur;
int main() {
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for(int i=0;i<n;i++)
scanf("%d", &a[i]);
cur = (a[0]>=0)?a[0]:0;
stcur = (a[0]>=0)?0:1;
for(int i=1;i<n;i++) {
cur += a[i];
if(cur>ans) {
ans = cur;
stmax = stcur;
drmax = i;
}
if(cur<0) {
stcur = i+1;
cur = 0;
}
}
printf("%lld %d %d", ans, stmax+1, drmax+1);
return 0;
}