搜索资源列表
0-1wenti
- 该程序是一个用动态规划法解决0-1背包问题的小程序，可以为学习动态规划法遇到困难的同学提供帮助-the program is a dynamic programming solution 0-1 knapsack problem of small procedures, to study the dynamic programming method difficulties encountered by students for help
01BEIBAOdongtai
- 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
dongtaiguihua
- 通过使用C++代码编写实现动态规划背包的最优解问题。-By using the C++ coding to achieve the optimal solution of dynamic programming knapsack problem.
01package
- 用动态规划法解决01背包问题，编译器编译通过，绝对正确。-01 knapsack problem using dynamic programming method to solve the compiler to compile through, absolutely correct.
0-1
- 用于解决0/1 背包问题动态规划详解及C代码，清晰明确，简单易学-Planning the Xiangjie and C code used to solve the 0/1 knapsack problem dynamic, clear, and easy to learn
01bag
- 用动态规划算法所编写是01背包问题的实现，能在ACM平台上通过-Prepared by using dynamic programming algorithm implementation is 01 knapsack problem, in ACM Platforms
0-1beibao
- 算法设计与分析 0-背包问题动态规划算法源代码-Algorithm Design and Analysis 0- knapsack problem dynamic programming algorithm source code
Cpp1
- 编写背包问题的动态规划求解代码。 背包问题 ，背包容量为W，物品个数为n，随机产生n个物品的体积（物品的体积不可大于W）与价值，求解该实例的最优解。 -Write knapsack problem dynamic Solver code. Knapsack problem, knapsack capacity of W, the number of items is n, randomly generated volume of n items (bulky items ca