Pagini recente » Cod sursa (job #755954) | Cod sursa (job #2660996) | Cod sursa (job #1169315) | Cod sursa (job #2514012) | Cod sursa (job #343915)
Cod sursa(job #343915)
#include <cstdio>
#include <cstdlib>
//using namespace std;
int bestSum,i,n,min,mini,xi,sum[6000000];
int main() {
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for (i=0;i<n;++i) scanf("%d",&sum[i]);
for (i=1;i<n;++i) sum[i] += sum[i-1];
bestSum = -(1<<31);
min = sum[0];
mini = 1;
for (i=1;i<n;++i) {
if ((sum[i] - min) > bestSum) {
bestSum = sum[i] - min;
xi = i+1;
}
if (min > sum[i]) {min = sum[i];mini=i+1;}
}
printf("%d %d %d",bestSum,mini+1,xi);
fclose(stdin);
fclose(stdout);
return 0;
}