Cod sursa(job #490479)
| Utilizator | Data | 6 octombrie 2010 17:47:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
int i,v[6000001],u,a,p,s,n;
int max1=-2147;
int main(){
FILE* f=fopen("ssm.in","r");
FILE* g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for( i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
p=u=a=1;
for(i=1;i<=n;i++){
if(s<0) {
s=0; a=i;
}
s+=v[i];
if(s>max1){
max1=s;
u=i;
p=a;
}
}
fprintf(g,"%d %d %d ",max1,p,u);
fclose(f);
fclose(g);
return 0;
}
