演算法›Ch3 動態規劃第 4 題/共 40 題
4. Dynamic Programming、Unbounded Knapsack
#AL-03-004中Dynamic ProgrammingUnbounded Knapsack
Consider a knapsack with capacity 17 and five types of items, each with its size and value listed below. All items are available in unlimited quantities and each item can be selected more than once. The goal is to maximize the total value of the items placed in the knapsack. If the maximum value of the knapsack is where and are integers in , what is the value of ?
| item | A | B | C | D | E |
|---|---|---|---|---|---|
| size | 3 | 4 | 7 | 8 | 9 |
| value | 4 | 5 | 10 | 11 | 12 |
📄 台大114
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃