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