Description: N pieces of a given item, the weight they were w [0], w [1], ... ... w [n-1], the value of goods, respectively v [0], v [1], ... ... v [n-1], while a backpack, which can accommodate a total weight w. Design an item selecting program, requested items from n items selected in the total weight does not exceed the capacity of backpack w, to select the items and the maximum value.
To Search:
- [0-1package] - At 0 and 1 backpack case for problem-sol
File list (Check if you may need any files):
新建 文本文档.txt
Download