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