Cod sursa(job #586869)
Utilizator | Cotirlea Anamaria Anamaria20 | Data | 3 mai 2011 09:18:20 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
FILE *f,*s;
int i,j,k,l,m,n;
int v[6000000];
int main()
{
f=fopen("ssm.in","r");
s=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&v[i]);
v[i]+=v[i-1];
}
int in=0;
int sf=0;
int rz=0;
m=0;
for(i=1;i<=n;i++)
{
if(v[i]-v[m]>rz)
{
in=m+1;
sf=i;
rz=v[i]-v[m];
}
if(v[i]<v[m])
m=i;
}
fprintf(s,"%d %d %d",rz,in,sf);
fclose(s);
return 0;
}