【PAT】python 1007 Maximum Subsequence Sum

If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.
注意：测试点4，如果全为负数，则输出 0 ，序列第一个数，序列最后一个数
动态规划

k=int(input())
lis=list(map(int,input().split()))
res=[0 for i in range(k)]
iid=[0 for i in range(k)]
res[0]=lis[0]
for i in range(1,k):
    if res[i-1]+lis[i]>lis[i]:
        res[i] = res[i - 1] + lis[i]
        iid[i] =iid[i-1]+1
    else:
        res[i]=lis[i]
a=max(res)
b=res.index(a)
if a<0:
    print("%d %d %d"%(0,lis[0],lis[-1]))
else:
    print("%d %d %d"%(a,lis[b-iid[b]],lis[b]))