Cod sursa(job #2580769)
| Utilizator | Data | 14 martie 2020 09:38:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <climits>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, st, dr, s, smax = INT_MIN;
int main()
{
fin >> n;
int stS, drS;
for (int i = 1, x; i <= n; ++i)
{
fin >> x;
if ((s + x) < x)
{
s = x;
stS = i;
}
else
{
s += x;
drS = i;
}
if (smax < s)
{
smax = s;
st = stS;
dr = drS;
}
}
fout << smax << ' ' << st << ' ' << dr;
fin.close();
fout.close();
return 0;
}
