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