题解 | #子数组的最大累加和问题#

n = int(input())
nums = list(map(int, input().split()))
before = nums[0]
res = nums[0]
for i in range(1, n):
    before = max(nums[i], nums[i] + before)
    res = max(res, before)
print(res)