查看会员资料
用 户 名:M*****
发送消息- Email:用户隐藏
- Icq/MSN:
- 电话号码:
- Homepage:
- 会员简介:
最新会员发布资源
0-1Jump
- 用动态规划去解答0-1背包问题,此方法是在经典背包问题上进行的跳跃点优化而解答出来的,已成功通过编译调试-Using dynamic programming to answer 0-1 knapsack problem, this method is carried out on the classic knapsack problem jumps out optimization solutions, has successfully passed the compiler debugging