Cod sursa(job #495168)
Utilizator | Data | 24 octombrie 2010 12:25:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
long n,k,i,j,sf,in,s,max=-1000,ini,sfi;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%ld",&n);
in=1;
sf=1;
for(i=1;i<=n;i++){
scanf("%ld",&k);
s+=k;
if(s<=0){
in=i+1;
s=0;
}
sf++;
if(s>max){
max=s;
ini=in;
sfi=sf-1;
}
}
printf("%ld %ld %ld",max,ini,sfi);
return 0;
}