Cod sursa(job #3306047)
| Utilizator | Data | 6 august 2025 22:45:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <climits>
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int s_max = INT_MIN, s = 0, beg, end, n, idx;
fin >> n;
int x;
for (int i = 1; i <= n; i++) {
fin >> x;
if (s < 0) {
s = x, idx = i;
} else {
s += x;
}
if (s_max < s) {
s_max = s;
beg = idx;
end = i;
}
}
fout << s_max << " " << beg << " " << end << '\n';
return 0;
}
