Cod sursa(job #2473941)
Utilizator | Dohotariu Adrian Podie | Data | 14 octombrie 2019 15:19:47 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,a,ma,st,dr,i,s,x;
FILE *fin,*fout;
fin=fopen("ssm.in","r");
fout=fopen("ssm.out","w");
fscanf(fin,"%d",&n);
x=1;
s=ma=-2000000000;
for(i=0; i<n; i++)
{
fscanf(fin,"%d",&a);
if(s<0)
{
s=0;
x=i+1;
}
s+=a;
if(s>ma)
{
st=x;
dr=i+1;
ma=s;
}
}
fprintf(fout,"%d %d %d",ma,st,dr);
fclose(fin);
fclose(fout);
return 0;
}