动态规划-背包-01背包
文章平均质量分 89
普通网友
这个作者很懒,什么都没留下…
展开
-
hdu3496+poj1948(二维费用背包)
Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5106 Accepted Submission(s): 1614Problem DescriptionNew semester i原创 2014-05-22 16:23:47 · 1105 阅读 · 0 评论 -
hdu2159(贪心+01背包)
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7177 Accepted Submission(s): 2429Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前原创 2013-08-04 11:33:30 · 918 阅读 · 0 评论 -
poj3624(01背包)
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17288 Accepted: 7850DescriptionBessie has gone to the mall's jewelry store and spies a c原创 2013-08-03 16:28:07 · 846 阅读 · 0 评论 -
HDU1203(01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11712 Accepted Submission(s): 4481Problem DescriptionSpeakless很早原创 2013-05-03 20:18:00 · 761 阅读 · 0 评论 -
hdu3466(01背包)
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1762 Accepted Submission(s): 709Problem DescriptionRecently, iSea原创 2013-07-24 15:07:36 · 766 阅读 · 0 评论 -
hdu2955(01背包)
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7975 Accepted Submission(s): 3018Problem DescriptionThe aspiring Roy the原创 2013-08-07 20:01:30 · 615 阅读 · 0 评论 -
hdu2639(第k大值+01背包)
Bone Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1526 Accepted Submission(s): 785Problem DescriptionThe title of原创 2013-08-03 20:59:52 · 883 阅读 · 0 评论 -
背包问题的一些想法
在此说明,以下是我算法基础的节课报告,彭雷老师要求以组为单位做汇报,汇报已过,贴出思路与大家共享,并作为读书笔记存于博客。问题描述 背包问题有很多种,一般描述为有一背包容量为maxVolume,有numOfGood件物品,对应体积、价值和数量分别为volume[i]、price[i]、number[i]。 满足以下方程 ∑vo原创 2014-04-09 13:11:56 · 1920 阅读 · 0 评论