Cod sursa(job #2178618)
Utilizator | Data | 19 martie 2018 17:00:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <climits>
#define Nmax 6000002
using namespace std;
int n, v[Nmax], s=INT_MIN, posi, posj, minim, beg;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>v[i];
v[i]=v[i]+v[i-1];
if(s<v[i]-minim)
{
s=v[i]-minim;
posi=i;
posj=beg+1;
}
if(minim>v[i])
{
minim=v[i];
beg=i;
}
}
fout<<s<<' '<<posj<<' '<<posi;
return 0;
}