Cod sursa(job #2634233)
Utilizator | Gaspar Robert Andrei gasparrobert95 | Data | 10 iulie 2020 10:36:52 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, el, best = -int(2e9), idx, inceput, sfarsit, sum;
int main() {
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> el;
if (sum < 0)
sum = el, idx = i;
else
sum += el;
if (best < sum)
best = sum, inceput = idx, sfarsit = i;
}
fout << best << " " << inceput << " " << sfarsit;
return 0;
}