Cod sursa(job #3344918)

Utilizator Teo_y62Teodora Dulgheru Teo_y62 Data 6 martie 2026 17:34:45
Problema Subsecventa de suma maxima Scor 0
Compilator py Status done
Runda Arhiva educationala Marime 0.33 kb
Raporteaza aceasta sursa 

class Solution:
    def ssm(self, n, v):
        dp = [0] * (n)
        dp[0] = v[0]

        rez = dp[0]
        for i in range(1, n):
            if dp[i-1] >= 0:
                dp[i] = dp[i-1] + v[i]
            else:
                dp[i] = v[i]
            if dp[i] > rez:
                rez = dp[i]
        
        return rez