Cod sursa(job #3275062)
| Utilizator | Data | 9 februarie 2025 10:23:02 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main(void) {
int n, x, idx_start = 1, temp_start = 1, idx_end = 1;
long long sum = 0, sum_max = LLONG_MIN;
in >> n;
for (int i = 1; i <= n; i++) {
in >> x;
if (sum + x > x)
sum += x;
else {
sum = x;
temp_start = i;
}
if (sum > sum_max) {
sum_max = sum;
idx_start = temp_start;
idx_end = i;
}
}
out << sum_max << " " << idx_start << " " << idx_end;
return 0;
}