给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Given n types of items and a backpack. Item i is the weight wi, the value of vi, backpack capacity of c. Asked how to choose the items into the backpack, backpack into making the total value of the largest items. In the choice of loading backpack items, for each item i have only two choices, that is not loaded into a backpack or bag. Items into the backpack i can not be repeated, and not only into some of the items i. Therefore, the problem is called 0-1 knapsack problem.