Description: Given n types of items and a backpack, the weight of item i is wi, the value of vi, backpack capacity C. Asked how to choose the items into backpacks, backpack made into the largest total value of goods? Select items in the backpack when loaded on only two choices for each item i, that is not loaded into backpack or bag, items can not be loaded backpack many times i can not just load some of the items i.
To Search:
- [0_1question] - computer algorithm famous 0_1 knapsack p
- [optimal] - Optimal binary search trees, all more th
- [zhongweishu.cpp] - X [0: n-1] and Y [0: n-1] for the two ar
File list (Check if you may need any files):
knapsack.cpp
Download