Cod sursa(job #402230)
| Utilizator | Data | 23 februarie 2010 17:54:10 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
FILE*f=fopen("ssm.in","r");
FILE*g=fopen("ssm.out","w");
int s,i,j,x,t,y,n,max,i1,i2,j1,p;
int a[6000001];
int v[6000001];
int main() {
fscanf(f,"%d",&n);
fscanf(f,"%d",&v[1]);
for(i=1;i<=n;i++){
fscanf(f,"%d",&t);
a[i]=a[i-1]+t;
}
max=-2000000;
for(i=2;i<=n;i++){
if(max<a[i]-p){
max=a[i]-p;
i1=i2+1;
j1=i;
}
if(p>a[i]){
p=a[i];
i2=1;
}
}
fprintf(g,"%d %d %d",max,i1,j1);
fclose(g);
fclose(f);
return 0;
}
