Pagini recente » Cod sursa (job #2647848) | Cod sursa (job #1692270) | Cod sursa (job #2273472) | Cod sursa (job #2989208) | Cod sursa (job #1219075)
#include <iostream>
#include <stdio.h>
using namespace std;
int n,sum,a[6000005];
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]);
}
int min = a[0],sum = a[0],bestSum = a[0],startPoz = 0,endPoz = 0,finStartPoz = 0;
for(int i = 1; i < n; i++){
sum += a[i];
if(sum - min > bestSum)
bestSum = sum - min,
endPoz = i,
finStartPoz = startPoz;
if(min > sum)
min = sum,
startPoz = i + 1;
}
printf("%d %d %d\n",bestSum,finStartPoz + 1,endPoz + 1);
return 0;
}