Pagini recente » Cod sursa (job #120854) | Cod sursa (job #3283192) | Cod sursa (job #519808) | Cod sursa (job #116327) | Cod sursa (job #265856)
Cod sursa(job #265856)
#include<stdio.h>
int a[6000005];
int b[6000005];
int maxsum;
int pi;
int poz;
int ps;
int n;
int min;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(int i = 1; i <= n; i++)
{
scanf("%d",&a[i]);
b[i] = b[i-1] + a[i];
}
min = 0;
maxsum = b[1];
for(int i = 1; i <= n; i++)
{
if (b[i] - min > maxsum)
{
maxsum = b[i] - min;
pi = poz + 1;
ps = i;
}
if (min > b[i])
{
min = b[i];
poz = i;
}
}
printf("%d %d %d \n",maxsum, pi, ps);
return 0;
}