Cod sursa(job #362008)
| Utilizator | Data | 7 noiembrie 2009 16:38:39 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
int best,n,x,start,lung,B,S,L;
int main(){
FILE * f=fopen("ssm.in", "r");
FILE * g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
B = -int(2e9);
best=0;
start=1;
int i;
for(i=1;i<=n;++i){
fscanf(f,"%d",&x);
best+=x;
++lung;
if ( B < best ) { B = best; L = i ; S = i - lung + 1 ;}
if( best < 0 ) {
best = 0;
lung = 0;
}
}
fprintf(g,"%d %d %d",B,S,L);
return 0;
}
