백준 1912 - 연속합 (파이썬)
Updated:
Answer
n = int(input())
a = list(map(int, input().split()))
answer = [0] * n
answer[0] = a[0]
for i in range(len(a) - 1):
answer[i+1] = max(answer[i] + a[i+1], a[i+1])
print(max(answer))
Updated:
n = int(input())
a = list(map(int, input().split()))
answer = [0] * n
answer[0] = a[0]
for i in range(len(a) - 1):
answer[i+1] = max(answer[i] + a[i+1], a[i+1])
print(max(answer))