说明：  01背包问题题目 有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包...但它却是另一个重要的背包问题P02最简捷的解决方案,故学习只用一维数组解01背包问题是十分必要的。
(01 knapsack problem subject N items and a capacity of V backpack. The first i items cost c [i], the value of w [i]. Solution which items will be loaded backpack ... but it is another important knapsack problem P02 the most simple and quickest solution, it is to learn only one-dimensional array of 01 knapsack problem solution is very necessary.)