Cod sursa(job #2927293)
| Utilizator | Data | 19 octombrie 2022 21:54:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
int main() {
std::ifstream input("ssum.in");
std::ofstream output("ssum.out");
int n;
input >> n;
int sum = -1, max = INT32_MIN, start = 0, finish = 0, cnd = 0;
for (int i = 1; i <= n; ++i) {
int a;
input >> a;
if (sum < 0) {
sum = 0;
cnd = i;
}
sum += a;
if (sum > max) {
max = sum;
start = cnd;
finish = i;
}
}
output << max << " " << start << " " << finish;
return 0;
}
