Cod sursa(job #361241)
Utilizator | Data | 4 noiembrie 2009 11:52:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<cstdio>
int n,i,k,s,max,inc,sf,x[6000005];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
s=0; k=1;
for(i=1;i<=n;++i)
scanf("%d",&x[i]);
max=x[1];
for(i=2;i<=n;++i)
{
s+=x[i];
if(s>max)
{
inc=k;
sf=i;
max=s;
}
if(s<0)
{
s=0;
k=i+1;
}
}
printf("%d %d %d",max,inc,sf);
return 0;
}