Cod sursa(job #2713935)
| Utilizator | Data | 28 februarie 2021 22:16:57 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main(){
int n, sum = 0, best_sum = -1e9, index, beg, fina, x;
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> x;
if (sum < 0) {
index = i;
sum = 0;
}
sum += x;
if (sum > best_sum) {
beg = index;
fina = i;
best_sum = sum;
}
}
fout << best_sum << " " << beg << " " << fina;
return 0;
}
