Cod sursa(job #269191)
Utilizator | Data | 2 martie 2009 17:15:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int in,sf,ri,rf,i,j,k,a,s,n;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d%d",&n,&s);
k=s;
in=1;
sf=1;
for (i=2;i<=n;i++)
{
scanf("%d",&a);
if (s<0)
{
s=0;
in=i;
sf=i-1;
}
s+=a;
sf++;
if (s>k)
{
k=s;
ri=in;
rf=sf;
}
}
printf("%d %d %d\n",k,ri,rf);
return 0;
}