Pagini recente » Cod sursa (job #2291893) | Cod sursa (job #2513953) | Cod sursa (job #3139392) | Cod sursa (job #2796308) | Cod sursa (job #343925)
Cod sursa(job #343925)
#include <cstdio>
#include <cstdlib>
//using namespace std;
int bestSum,i,n,min,mini,xi,yi,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]);
bestSum = -(1<<30);
min = sum[0];
mini = 1;
for (i=1;i<n;++i) {
sum[i]+=sum[i-1];
if ((sum[i] - min) > bestSum) {
bestSum = sum[i] - min;
xi = mini+1;
yi = i+1;
}
if (min > sum[i]) {min = sum[i];mini=i+1;}
}
printf("%d %d %d\n",bestSum,xi,yi);
fclose(stdin);
fclose(stdout);
return 0;
}