演算法›Ch3 動態規劃
第 14 題/共 40 題
◀ AL 14/40
14. 0/1 Knapsack、Dynamic Programming、遞迴式
#AL-03-014易0/1 KnapsackDynamic Programming遞迴式

Consider the following six items with their weights and values. Suppose you have a knapsack with a maximum weight capacity of 10.

Item123456
Weight (ww)2145210
Value (vv)10628501080

Suppose you can only choose to take or leave each entire item. Let V[i][j]V[i][j] denote the highest total value you can obtain with items 1∼i1{\sim}i and a knapsack of weight capacity jj. Which of the following recurrence relations is correct?

📄 台大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃
本章題號 · 1–20 / 40