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