查看会员资料
用 户 名：潘***
发送消息- Email：用户隐藏
- Icq/MSN：
- 电话号码：
- Homepage：
- 会员简介：
最新会员发布资源
knapsack
- C语言背包问题 Given n objects and a "knapsack." Item i weighs wi > 0 kilograms and has value vi > 0. ◦ Knapsack has capacity of W kilograms. ◦ Goal: fill knapsack so as to maximize total value.-C-Knapsack Problem Given n objects and