Cod sursa(job #535739)
| Utilizator | Data | 17 februarie 2011 18:23:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 65 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
long int v[6000000],n,i,sum,smax,st,a,b;
int main ()
{FILE *f=fopen("ssm.in","r"), *g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++) fscanf(f,"%d",&v[i]);
sum=smax=v[1];
for(i=2;i<=n;i++)
if(sum<0)
{sum=v[i];a=i;}
else {sum=sum+v[i];
if(smax<sum) {smax=sum;b=i;}}
fprintf(g,"%d %d %d",smax,a,b);
fclose(f);
fclose(g);
return 0;
}
