백준 1912 연속합

https://www.acmicpc.net/problem/1912

1912번: 연속합

n = int(input())
m = list(map(int, input().split()))

r = m[0]
result = max(m)

if max(m)<0:
    print(max(m))
else:
    for i in range(1, n):
        r += m[i]
        if r < 0:
            r = 0
        result = max(result,r)
    print(result)

n = int(input())
l = list(map(int, input().split()))

dp = [0 for i in range(n)]
dp[0] = l[0]

for i in range(1,n):
    dp[i] = max(dp[i-1]+l[i],l[i])
print(max(dp))