文件名称:knapsack
介绍说明--下载内容均来自于网络,请自行研究使用
蛮力法和动态规划法解决01背包问题。输入文件"backpack.in":第一行两个整数:物品个数N,背包容量.之后N行每行两个整数,分别为物品重量和物品价值-Dynamic programming method to solve the 01 backpacks problem. The input file backpack.in,: two integers: the first line items number N, backpack capacity after two integers N lines, respectively, for the weight of the article and the value of goods
(系统自动生成,下载前可以参看下载内容)
下载文件列表
DP.cpp
output.txt
readme.txt
backpack.in
BruteForce.cpp