Cod sursa(job #3345356)
| Utilizator | Data | 9 martie 2026 13:18:39 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int n, x, dp = 0, len = 0, best = 0;
int bestst, bestlen;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> x;
if (dp + x >= x) {
len++;
dp = dp + x;
} else {
len = 1;
dp = x;
}
if (best < dp) {
best = dp;
bestst = i;
bestlen = len;
}
}
fout << best << " " << bestst - bestlen + 1 << " " << bestst;
}
