Cod sursa(job #306755)
Utilizator | Data | 21 aprilie 2009 21:51:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
int i,v,n,s=0,j=0,max=0,pozi,pozj;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n; ++i)
{ scanf("%d",&v);
s+=v;++j;
if(s<0)
{ s=0;
j=0;
}
if(max<s)
{ max=s;
pozi=i;
pozj=i-j+1;
}
}
printf("%d %d %d",max,pozj,pozi);
return 0;
}