python 完全背包问题_AcWing 3. 完全背包问题（python3代码）

一维动态规划

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

goods = []

for i in range(n):

goods.append([int(i) for i in input().split()])

dp = [0 for i in range(v+1)]

for i in range(n):

for j in range(v,-1,-1): # 从后往前

k = j//goods[i][0]

dp[j] = max([dp[j- x* goods[i][0]] + x * goods[i][1] for x in range(k+1)])

print(dp[-1])

一维动态规划（优化）

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

goods = []

for i in range(n):

goods.append([int(i) for i in input().split()])

dp = [0 for i in range(v+1)]

for i in range(n):

for j in range(v+1): # 从前往后

if j >= goods[i][0]:

dp[j] = max(dp[j], dp[j-goods[i][0]]+goods[i][1])

print(dp[-1])