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