m, n = input().split() m, n = int(m), int(n) ma = [] for _ in range(m): tmp = [] for x in input().split(): tmp.append(int(x)) ma.append(tmp) opt = [0] * (n+1) for i in range(m): for j in range(n, 0, -1): tmp = 0 for k in range(0, n): if(k >= j): break tmp = max(tmp, ma[i][k]+opt[j-k-1]) opt[j] = max(tmp, opt[j]) print(max(opt)) 背包过了
点赞 3

相关推荐

点赞 评论 收藏
分享
牛客网
牛客网在线编程
牛客网题解
牛客企业服务