蓝桥杯算法提高-数组求和 python

参考代码:

n,m = map(int,input().split())

lst = list(map(int,input().split()))

lst.extend(lst)

maxnum = []

for i in range(int(len(lst)/2)):

    maxnum.append(sum(lst[i:i+m]))

print(max(maxnum))