Cod sursa(job #2134265)
| Utilizator | Data | 17 februarie 2018 19:49:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
int main()
{
int n,x,nr=0,suma_optima=-9999999,sum_int=0,i,li,lf,poz_int;
f=fopen("ssm.in","r");
g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&x);
if(sum_int<0)
{
sum_int=x;
poz_int=i;
}
else
sum_int+=x;
if(sum_int>suma_optima)
{
suma_optima=sum_int;
li=poz_int;
lf=i;
}
}
fprintf(g,"%d %d %d",suma_optima,li,lf);
fclose(f);
fclose(g);
return 0;
}
