Cod sursa(job #269226)
Utilizator | Sebestin Dragos DrakeDemon | Data | 2 martie 2009 17:49:52 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<stdio.h>
unsigned int i,j,n,max,pmin,pmax,v[2001],sum;
int main(){
FILE *f = fopen("ssm.in","r");
FILE *g = fopen("ssm.out","w");
fscanf(f,"%d\n",&n);
for(i=1;i<=n;i++){
fscanf(f," %d",&v[i]);
}
for(i=1;i<=n;i++){
for(j=i;j<=n;j++){
sum = sum + v[j];
if(sum>max){
max = sum ;
pmax = j;
pmin = i;
}
if(sum == max)
if(j<pmin)
pmin = j;
}
sum = 0;
}
fprintf(g,"%d %d %d",max,pmin,pmax);
fclose(f);
fclose(g);
return 0;
}