Cod sursa(job #2531239)
| Utilizator | Data | 25 ianuarie 2020 22:40:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main() {
int n, i, st = 1, dr = 1, poz = 1, sum = 0, val, best = -(1 << 30);
f >> n;
for (i = 1; i <= n; i++) {
f >> val;
if (sum < 0) {
poz = i;
sum = val;
}
else sum += val;
if (sum > best) {
best = sum;
st = poz;
dr = i;
}
}
g << best << ' ' << st << ' ' << dr;
}