随笔分类 -  动态规划-多重背包

摘要:Big Event in HDU Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41952 Accepted Submission(s): 1 阅读全文
posted @ 2017-07-17 11:13 starry_sky 阅读(165) 评论(0) 推荐(0)
摘要:Coins Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 37856 Accepted: 12852 Description People in Silverland use coins.They have coins of v 阅读全文
posted @ 2017-07-17 11:10 starry_sky 阅读(133) 评论(0) 推荐(0)
摘要:Dividing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26338 Accepted Submission(s): 7523 Probl 阅读全文
posted @ 2017-07-17 11:07 starry_sky 阅读(201) 评论(0) 推荐(0)
摘要:有N种物品,每种物品的数量为C1,C2......Cn。从中任选若干件放在容量为W的背包里,每种物品的体积为W1,W2......Wn(Wi为整数),与之相对应的价值为P1,P2......Pn(Pi为整数)。求背包能够容纳的最大价值。 Input 第1行,2个整数,N和W中间用空格隔开。N为物品的 阅读全文
posted @ 2017-07-17 09:54 starry_sky 阅读(213) 评论(0) 推荐(0)