Cod sursa(job #2443925)
Utilizator | Data | 29 iulie 2019 19:04:49 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int Nmax = 6000000 + 5;
int a[Nmax], n, s, bg, en,mx = -999999999, lm, ansb;
int main()
{
fin >> n;
bg = 1;
for(int i = 1; i <= n; ++i)
{
fin >> a[i];
if(s < 0)
{
s = a[i];
bg = i;
}
else s += a[i];
if(s > mx || (s == mx && lm > i - bg + 1))
{
mx = s;
lm = i - bg + 1;
ansb = bg;
}
}
fout << mx << ' ' << ansb << ' ' << ansb + lm - 1;
return 0;
}