题解 | #连续最大和#
连续最大和
http://www.nowcoder.com/practice/5a304c109a544aef9b583dce23f5f5db
def lianxu(a):
size = len(a)
pre = 0
res = a[0]
for i in range(size):
pre = max(a[i],pre+a[i])
res = max(res,pre)
return res
n = int(input())
nums = list(map(int,input().split()))
res = lianxu(nums)
print(res)
查看5道真题和解析