演算法›Ch3 動態規劃第 15 題／共 40 題
15. 0/1 Knapsack、Dynamic Programming
#AL-03-015易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.
| Item | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| Weight () | 2 | 1 | 4 | 5 | 2 | 10 |
| Value () | 10 | 6 | 28 | 50 | 10 | 80 |
Suppose you can only choose to take or leave each entire item. What is the highest total value you can get by filling your knapsack (capacity 10)? A. 184 B. 90 C. 84 D. 80
📄 台大110
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃