51 nod 1050 循环数组最大子段和

  刚开始想到用动态规划，每个数作为开始挨个算。代码如下，刚开始用python，代码有点不规范 def maxList(nums,data): max = 0 for i in range(0,nums): max1=0 j = i+1 k = 1 res = [0] * nums res[0] = d

>>阅读原文<<