Cod sursa(job #2709317)
| Utilizator | Data | 20 februarie 2021 10:20:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int n;
fin >> n;
int v[n + 5];
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
int sum = 0, best_sum = -int(2e9) , begin, end, idx;
for (int i = 1; i <= n; ++i) {
if (sum < 0) {
idx = i;
sum = v[i];
}
else {
sum += v[i];
}
if (sum > best_sum) {
best_sum = sum;
begin = idx;
end = i;
}
}
fout << best_sum << " " << begin << " " << end;
return 0 ;
}
