Cod sursa(job #3344915)

Utilizator Teo_y62Teodora Dulgheru Teo_y62 Data 6 martie 2026 17:23:28
Problema Subsecventa de suma maxima Scor 0
Compilator py Status done
Runda Arhiva educationala Marime 0.26 kb
Raporteaza aceasta sursa 
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