Cod sursa(job #3165583)
| Utilizator | Data | 6 noiembrie 2023 16:18:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x, s, currentStart = 1, maxim, maximL, maximR;
int main()
{
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> x;
if (s + x >= x) {
s += x;
}
else {
s = x;
currentStart = i;
}
if (maxim < s) {
maxim = s;
maximL = currentStart;
maximR = i;
}
}
fout << maxim << " " << maximL << " " << maximR;
}