动态规划-背包-多重背包
文章平均质量分 88
普通网友
这个作者很懒,什么都没留下…
展开
-
HDU2159(多重背包)
FATE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5216 Accepted Submission(s): 2355 Problem Description 最近xhd正在玩一款叫做FATE的游戏,为了得到极原创 2013-06-18 21:49:58 · 715 阅读 · 0 评论 -
hdu1059(多重背包)
Dividing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12868 Accepted Submission(s): 3611 Problem Description Marsha and Bill own原创 2013-08-04 17:13:11 · 682 阅读 · 0 评论 -
hdu1171(多重背包)
Big Event in HDU Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18647 Accepted Submission(s): 6522 Problem Description Nowadays, w原创 2013-08-07 11:35:26 · 792 阅读 · 0 评论 -
hdu1276(多重背包)
Cash Machine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23771 Accepted: 8316 Description A Bank plans to install a machine for cash withdrawal. The mach原创 2013-08-04 16:43:21 · 855 阅读 · 0 评论 -
hdu2392(多重背包)
Space Elevator Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7154 Accepted: 3353 Description The cows are going to space! They plan to achieve orbit by bui转载 2013-08-04 15:48:48 · 908 阅读 · 0 评论 -
背包问题的一些想法
在此说明,以下是我算法基础的节课报告,彭雷老师要求以组为单位做汇报,汇报已过,贴出思路与大家共享,并作为读书笔记存于博客。 问题描述 背包问题有很多种,一般描述为有一背包容量为maxVolume,有numOfGood件物品,对应体积、价值和数量分别为volume[i]、price[i]、number[i]。 满足以下方程 ∑vo原创 2014-04-09 13:11:56 · 1919 阅读 · 0 评论