Description: Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
To Search:
- [0-1beibao] - 0-1 knapsack problem of the dynamic prog
- [knapsack] - 0-1 knapsack problem, a typical dynamic
File list (Check if you may need any files):
knapsack\input.txt
........\习题7.27-背包问题.cpp
knapsack
Download