Cod sursa(job #2709301)
Utilizator | Data | 20 februarie 2021 10:09:45 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int n, x;
fin >> n;
int bestSum = -int(2e9), sum = 0, beg, end, idx;
for (int i = 1; i <= n; ++i) {
fin >> x;
if (sum < 0) {
sum = x;
idx = i;
}
else {
sum += x;
}
if (sum > best_Sum) {
best_Sum = sum;
beg = idx;
end = i;
}
}
fout << bestSum << " " << beg << " " << end;
return 0 ;
}