给定n种物品和一背包。物品i的重量是wi，体积是bi，其价值为vi，背包的容量为c，容积为d。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或者不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。试设计一个解此问题的动态规划算法，并分析算法的计算复杂性。(Given n items and a knapsack. The weight of the item I is wi, the volume is Bi, its value is VI, the capacity of the knapsack is C, the volume is d. How do you choose to choose the items in the backpack to make the most of the total value of the items in the backpack? When choosing a backpack, there are only two options for each item I, that is, to be loaded into a backpack or not to be loaded into a backpack. You can't load an item I into a backpack many times, and you can't just load a part of the item I. A dynamic programming algorithm for solving this problem is designed and the computational complexity of the algorithm is analyzed.)