Cod sursa(job #628432)
Utilizator | Simionescu Octavian-Gabriel Khezka | Data | 1 noiembrie 2011 13:25:44 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int i,i1,max1=-2100000,x,pozi,pozj,suma=-1,n;
int main()
{
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for (i=1;i<=n;++i)
{
fscanf(f,"%d",&x);
if(suma>0)
suma =suma+x;
else
{
i1=i;
suma= x;
}
if (suma>max1)
{
max1=suma;
pozi=i1;
pozj=i;
}
}
fprintf(g,"%d %d %d",max1,pozi, pozj);
return 0;
}