Cod sursa(job #1368888)
Utilizator | Data | 2 martie 2015 20:30:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
long long n,i,x,st,fn,aux,sol,sum;
int main()
{
FILE*f1,*f2;
f1=fopen("ssm.in","r");
f2=fopen("ssm.out","w");
fscanf(f1,"%ld",&n);
for(i=1;i<=n;i++)
{
fscanf(f1,"%lld",&x);
if(sum<0)
{
sum=x;
aux=i;
}
else sum+=x;
if(sum>sol)
{
sol=sum;
fn=i;
st=aux;
}
}
fprintf(f2,"%lld %lld %lld",sol,st,fn);
return 0;
}