Cod sursa(job #3344914)
| Utilizator | Data | 6 martie 2026 17:22:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | py | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
def ssm(n, v):
dp = [0] * (n)
dp[0] = v[0]
rez = dp[1]
for i in range(2, n):
if dp[i-1] >= 0:
dp[i] = dp[i-1] + v[i-1]
else:
dp[i] = v[i]
if dp[i] > rez:
rez = dp[i]
return rez
print(ssm(6, [-10, 2, 3, -1, 2,-3]))