Cod sursa(job #2190695)
| Utilizator | Data | 31 martie 2018 16:01:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define nMax 6000005
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long n,v[nMax],i;
int best=-1*nMax,st,dr,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
int s=0;
for(i=1;i<=n;i++)
{
if(s<0){s=v[i];k=i;}
else s+=v[i];
if(best<s){best=s,st=k,dr=i;}
}
fout<<best<<' '<<st<<' '<<dr;
}
