Cod sursa(job #1812298)
| Utilizator | Data | 21 noiembrie 2016 22:43:34 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | gym1_emag_mediu_2016 | Marime | 0.76 kb |
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,x,nmax=INT_MAX,sumamax=INT_MIN,inceput,sfarsit,s=0,j=1,inceput2;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>x;
if(x>nmax)
{
nmax=x;
inceput2=j;
}
if(s+x>=0)
{
s+=x;
if(s>sumamax)
{
sumamax=s;
inceput=j;
sfarsit=i;
}
}
else
{
j=i+1;
s=0;
}
}
if(suma>INT_MIN) fout<<suma<<' '<<inceput<<' '<<sfarsit;
else fout<<nmax<<' '<<inceput2<<' '<<inceput2;
return 0;
}
