Cod sursa(job #280749)
Utilizator | Data | 13 martie 2009 15:50:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
int main()
{
long j=0,i,x,s=0,max=0,c1=1,m1,m2,n;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%ld",&n);
for(i=1; i<=n; ++i)
{
scanf("%ld",&x);
if(s>=0) { s+=x; j++; }
else { j=0; s=x; c1=i; }
if(s>max) { max=s; m1=c1; m2=c1+j; }
}
printf("%ld %ld %ld\n",max,m1,m2);
return 0;
}