题解 | 最大子段和

import sys
def accsum(n,a):
    max_acc=acc=a[0]
    for i in range(1,n):
        acc=max(a[i]+acc,a[i])
        max_acc=max(max_acc,acc)
    return max_acc
def main():
    n=int(sys.stdin.readline())
    a=list(map(int,sys.stdin.readline().split()))
    res=accsum(n,a)
    print(res)
if __name__=="__main__":
    main()