Cod sursa(job #820894)
Utilizator | alexandru bondor bondor | Data | 21 noiembrie 2012 12:38:14 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
int main() {
int l11,s,l1,l2,max,n,i,nr;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
s=0;
max=-600000;
for(i=1; i<=n; i++) {
scanf("%d",&nr);
if(s<0){
s=0;
l1=i;
}
s+=nr;
if(s>max){
l11=l1;
l2=i;
max=s;
}
}
printf("%d %d %d",max,l11,l2);
return 0;
}