Cod sursa(job #495924)
Utilizator | Data | 27 octombrie 2010 11:30:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<cstdio>
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
long n,i,j=1,k,jm,km,sc=0,smax=0,x;
scanf("%ld",&n);
k=0;
for(i=1;i<=n;++i)
{
scanf("%ld",&x);
if(sc<0)
{
j=i;
k=j-1;
sc=0;
}
sc=sc+x;
++k;
if(sc>smax)
{
smax=sc;
jm=j;
km=k;
}
}
printf("%ld %ld %ld",smax,jm,km);
return 0;
}