已知有n中物品和一个可容纳M质量的背包，每种物品i的质量为Wi，假定将物品i放入背包，可以得到Pi的效益，求使背包中物品总效益最大的背包方案。

[{"title":"（ 9 个子文件 122KB ） 已知有n中物品和一个可容纳M质量的背包，每种物品i的质量为Wi，假定将物品i放入背包，可以得到Pi的效益，求使背包中物品总效益最大的背包方案。","children":[{"title":"0-1背包(回溯和分支界限","children":[{"title":"input.txt <span style='color:#111;'> 24B </span>","children":null,"spread":false},{"title":"Project1.bpf <span style='color:#111;'> 98B </span>","children":null,"spread":false},{"title":"Unit1.obj <span style='color:#111;'> 234.40KB </span>","children":null,"spread":false},{"title":"Project1.exe <span style='color:#111;'> 31.00KB </span>","children":null,"spread":false},{"title":"output.txt <span style='color:#111;'> 53B </span>","children":null,"spread":false},{"title":"Project1.bpr <span style='color:#111;'> 3.44KB </span>","children":null,"spread":false},{"title":"Project1.res <span style='color:#111;'> 876B </span>","children":null,"spread":false},{"title":"Project1.tds <span style='color:#111;'> 384.00KB </span>","children":null,"spread":false},{"title":"Unit1.cpp <span style='color:#111;'> 4.48KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]