Cod sursa(job #820867)
Utilizator | Data | 21 noiembrie 2012 12:03:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int main()
{
int n,i,nr,l=0,smax=-100000000,c1=1,cc1,cl,s=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&nr);
s+=nr;
l++;
if(s>smax)
{
smax=s;
cl=l;
cc1=c1;
}
if(s<=0)
{
s=0;
c1=i+1;
l=0;
}
}
printf("%d %d %d",smax,cc1,cc1+cl-1);
return 0;
}