Description: 01 knapsack problem: Given n types of items and a backpack. Item i of the weight of wi, the value of vi, c. Q backpack with a capacity of how to choose the items into the backpack, making the backpack into the largest total value of goods.
To Search:
File list (Check if you may need any files):
01背包改进.cpp
01背包问题.cpp
Download