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.

01背包改进.cpp
01背包问题.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．