背包问题
jmspan
这个作者很懒,什么都没留下…
展开
-
LintCode Backpack(背包)
原题网址:http://www.lintcode.com/en/problem/backpack/ Given n items with size Ai, an integer m denotes the size of a backpack. How full you can fill this backpack? Notice You can not divid原创 2016-06-21 00:29:43 · 899 阅读 · 0 评论 -
LintCode Backpack II(背包II)
原题网址:http://www.lintcode.com/en/problem/backpack-ii/ Given n items with size Ai and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack? Notice原创 2016-06-21 00:55:11 · 549 阅读 · 0 评论 -
LintCode Backpack III(背包III)
原题网址:http://www.lintcode.com/en/problem/backpack-iii/ Given n kind of items with size Ai and value Vi(each item has an infinite number available) and a backpack with size m. What's the maximum原创 2016-06-21 01:05:37 · 1249 阅读 · 0 评论