Cod sursa(job #402190)
Utilizator | FMI Tilica Robert Robert29 | Data | 23 februarie 2010 16:44:14 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
FILE*f=fopen("ssm.in","r");
FILE*g=fopen("ssm.out","w");
int ss,i,j,ii,jj,v[6000001],s[6000001],n;
int main() {
fscanf(f,"%d",&n);
for(i=1;i<=n;i++){
fscanf(f,"%d",&v[i]);
if(s[i-1]+v[i]>v[i])
s[i]=s[i-1]+v[i];
else{
s[i]=v[i];
j=i;
}
if(ss<s[i]){
ss=s[i];
ii=i;
jj=j;
}
}
fprintf(g,"%d %d %d",ss,jj,ii);
fclose(g);
fclose(f);
return 0;
}