01-复杂度2 Maximum Subsequence Sum (25 分)

01-复杂度2 Maximum Subsequence Sum (25 分)

k = int(input())
o = input().split()
sum = 0       #当前子列和
max = -1       #最大子列和
count = 0
temp = 0
first = 0
last = 0

for i in range(0, k):
    if int(o[i]) < 0:
        count += 1 
if count == k:
    print(0, o[0], o[k-1], sep = ' ')
else:
    for i in range(0, k):
        sum += int(o[i])
        if sum > max:    #如果当前子列和大于最大子列和，则更新最大子列和
            max = sum
            last = i
            first = temp
        if sum < 0:      #如果当前子列和为负，则对后续累计无好处，遂丢弃当前子列
            sum = 0
            temp = i + 1
    print(max, o[first], o[last], sep = ' ')