"""
P1115 最大子段和(python3实现)
https://www.luogu.com.cn/problem/P1115
"""
n=[0]*200001
ans=[0]*200001
sumx=-9999999
p=int(input())
n=list( map(int,input().split() ) )
for i in range( p):
ans[i+1]=max(ans[i]+n[i],n[i])
sumx=max(sumx,ans[i+1])
print(sumx)
1.6编程基础之一维数组_01与指定数字相同的数的个数
https://blog.csdn.net/dllglvzhenfeng/article/details/122288937
1.6 编程基础之一维数组 03 计算书费 python
https://blog.csdn.net/dllglvzhenfeng/article/details/122407565
1.6编程基础之一维数组_04数组逆序重放
https://blog.csdn.net/dllglvzhenfeng/article/details/122287905
1.6 编程基础之一维数组 05 年龄与疾病 python
https://blog.csdn.net/dllglvzhenfeng/article/details/122407896
1.6编程基础之一维数组_09向量点积计算
https://blog.csdn.net/dllglvzhenfeng/article/details/122301071
1.6 编程基础之一维数组 11 大整数减法
https://blog.csdn.net/dllglvzhenfeng/article/details/122689643