每種物品分別有C1和C2兩種費用,要求總費用分別不超過target1和target2,每種物品數量無限制,以下代碼輸出了最大價值,但我請問應該如何輸出都裝了哪些物品以及每種物品的件數?求完整代碼!
C1 = [3,2,6,7,1,4,9,5]
C2 = [6,2,4,6,7,3,8,5]
V = [6,3,5,8,3,1,6,9]
target1 = 20
target2 = 25
n = len(C1)
F = [[0] * (target2+1) for i in range(0,target1+1)]
for i in range(0,n):
for j in range(C1[i],target1+1):
for m in range(C2[i],target2+1):
F[j][m] = max(F[j][m],F[j-C1[i]][m-C2[i]] + V[i])
print (F[target1][target2])
轉載請註明出處,本文鏈接:https://www.uj5u.com/qita/247402.html
