Cod sursa(job #442988)
| Utilizator | Data | 15 aprilie 2010 20:49:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include<fstream.h>
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
long e,n,max,i,j,s[6000000],h,p=1;
int main()
{fscanf(f,"%ld",&n);
for(i=0;i<n;i++)
{
fscanf(f,"%ld",&e);
if(i==0) s[0]=e;
else
{
s[i]=s[i-1]+e;
if(i==1) max=s[i];
for(j=0;j<i;j++)
if(max<s[i]-s[j])
{
max=s[i]-s[j];
h=j+2;
p=i+1;
}
}
}
fprintf(g,"%ld %ld %ld",max,h,p);
return 0;
}
