背包问题
PoemK
这个作者很懒,什么都没留下…
展开
-
uva 11137 Ingenuous Cubrency
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2078二维:#include#include#include#include#include#include#include#include#include#include原创 2015-08-03 09:02:25 · 376 阅读 · 0 评论 -
ZOJ 3662 Math Magic 分阶段的动态规划 (+离散化) ★★★☆
Math MagicTime Limit: 3 Seconds Memory Limit: 32768 KBYesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you know, LCM (Least common multiple) of two positive number原创 2015-12-11 16:52:56 · 497 阅读 · 0 评论 -
poj 1276 Cash Machine 裸的多重背包 ★
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30547 Accepted: 11005DescriptionA Bank plans to install a machine for cash withdrawal. The原创 2015-12-11 19:46:50 · 517 阅读 · 0 评论 -
poj 2392 Space Elevator 排序(贪心)+多重背包 仍然很水 ★★
Space ElevatorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9955 Accepted: 4731DescriptionThe cows are going to space! They plan to achieve orbit by原创 2015-12-12 00:20:33 · 549 阅读 · 0 评论 -
uva 10817 - Headmaster's Headache 校长的烦恼
题目:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=465&page=show_problem&problem=1758显而易见的背包问题+集合动归关键是集合不是一般的集合,每门课的状态有三种:没有老师,有了1个老师,有两个及以上。1.我的办法原创 2016-01-22 16:00:00 · 492 阅读 · 1 评论 -
UVA - 12099 The Bookcase 书架
背包思想,书有宽度,书也有高度,这里宽度是典型的体积。因为分三层,为了方便考虑,给与约制:第一层的高度>第二层>第三层。(将书按从大到小的顺序排列)接下来进行分阶段的动态规划,每本书有三种选择:放在第一层,放在第二层,放在第三层。dp[2][v2][v3],滚动数组,v2表示第二层的数宽度和,v3表示第三层的书宽度和。因为所有书的宽度和一定,我们可以方便的计算出第一层的宽度和。原创 2016-02-15 21:38:17 · 711 阅读 · 0 评论 -
hdu 3535 AreYouBusy 经典混合背包
借此机会,整理一下背包中的某几类问题:物品分组,每组至少选一个:这个时候写法1:看别人博客,这样写省去了某些麻烦问题达不到的dp值为-INF dp[i][j]=max(dp[i][j],max(dp[i][j-w[x]]+p[x],dp[i-1][j-w[x]]+p[x]));也可设为-1在状态转移时判断哪些状态是达不到的。原创 2016-03-05 16:54:28 · 434 阅读 · 0 评论 -
hdu 1712 ACboy needs your help 分组背包
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5586 Accepted Submission(s): 3041Problem DescriptionACbo原创 2015-12-14 21:57:34 · 366 阅读 · 0 评论 -
poj 1837 Balance 分组背包
BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12281 Accepted: 7704DescriptionGigel has a strange "balance" and he wants to poise it. Actually原创 2015-12-16 18:57:35 · 272 阅读 · 0 评论 -
poj 3211 Washing Clothes 分组背包?
Washing ClothesTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 9241 Accepted: 2956DescriptionDearboy was so busy recently that now he has piles of cl原创 2015-12-17 13:19:29 · 389 阅读 · 0 评论 -
uvaLive 4490 Help Bubu 帮助布布 等价转化+DP
等价转换:从有n本书的书堆里面抽取k本书,再插入书堆里面,计算书的杂乱度等价于向空的书架上按给出的顺序放上n本书,再从中抽取k本书,然后插入书堆里面,计算书的杂乱度等价于向空的书架上按给出的顺序放上n-k本书,然后再放上k本书,想放哪放哪,计算书的杂乱度。显然第一阶段放n-k本书,就是一个简单的背包+集合动态规划。对于每一本书,可以选也可以不选。原创 2016-03-09 11:06:19 · 680 阅读 · 0 评论 -
poj 1717 Dominoes 背包
DominoesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6464 Accepted: 2131DescriptionA domino is a flat, thumbsized tile, the face of which is divide原创 2016-03-24 00:15:34 · 486 阅读 · 0 评论 -
多说都是泪 GDUT 广东工业大学2016校赛决赛-网络赛 1170 Problem B Sward Art Online
题目:点我http://gdutcode.sinaapp.com/problem.php?cid=1031&pid=1今天打网络个人赛,一开始就不太顺利,到了这个题,刚看到的时候,认为是手到擒拿,结果到最后也没AC。wa啊T的,最后想尽各种办法优化,结果解法越来越复杂,也离答案越来越远,最后题目认识得都是错的。有时人喝水也会塞牙缝,到最后一分钟,有人告诉我m最大只有500(原创 2016-04-10 23:38:31 · 786 阅读 · 0 评论 -
hdu 1028 Ignatius and the Princess III 整数拆分 母函数/dp
将一个正整数n拆成若干正整数,使和为n,求拆分方法数。12=1+1+10和12=1+10+1 是一种拆分方法。Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total S原创 2016-06-14 20:28:56 · 458 阅读 · 0 评论 -
hdu 5890 Eighty seven 背包bitset
题意:给出n(n<=50)个数,然后有Q(Q<=1e5)个查询,每次查询相互独立,内容是:抽走1到3个数,然后问剩下的数中,能否有10个数凑成87。解法:学别人写的bitset去优化背包,原来还STL还有bitset这个东西。 比赛的时候想优化结果想错了,比赛的时候认为就是先进行背包,然后 等价于求dp[87+sumV][10+cnt] 反例是 4 4 3 6 ,4+4+3=11,原创 2016-09-17 21:12:22 · 593 阅读 · 0 评论 -
hdu 1059 Dividing 多重背包 超级水题 ★
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21390 Accepted Submission(s): 6028Problem DescriptionMarsha and Bill原创 2015-12-10 20:13:33 · 423 阅读 · 0 评论 -
zoj 3524 Crazy Shopping 拓扑排序+完全背包 ★★★☆
Crazy ShoppingTime Limit: 3 Seconds Memory Limit: 65536 KBBecause of the 90th anniversary of the Coherent & Cute Patchouli (C.C.P), Kawashiro Nitori decides to buy a lot of rare things to原创 2015-12-10 16:30:54 · 437 阅读 · 0 评论 -
hdu 5410 CRB and His Birthday 背包问题 2015 Multi-University Training Contest 10 ★★★
CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 852 Accepted Submission(s): 450Problem DescriptionToday i原创 2015-09-07 16:20:31 · 369 阅读 · 0 评论 -
hdu 4939 Stupid Tower Defense dp
Stupid Tower DefenseTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1986 Accepted Submission(s): 545Problem DescriptionFSF原创 2015-11-18 08:18:07 · 454 阅读 · 0 评论 -
uva 562 Dividing coins 01背包
题目#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#pragma comment(linker, "/STACK:102400000,102400000")#de原创 2015-11-29 22:23:16 · 549 阅读 · 0 评论 -
hdu 2955 Robberies 01背包 ★★☆
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17691 Accepted Submission(s): 6531Problem DescriptionThe aspiring Ro原创 2015-11-30 11:19:56 · 304 阅读 · 0 评论 -
poj 2184 Cow Exhibition 01背包
Cow ExhibitionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10878 Accepted: 4305Description"Fat and docile, big and dumb, they look so stupid, they原创 2015-11-30 18:05:01 · 329 阅读 · 0 评论 -
hdu 2639 Bone Collector II 01背包 第k优解
Bone Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3338 Accepted Submission(s): 1716Problem DescriptionThe titl原创 2015-12-01 23:16:18 · 307 阅读 · 0 评论 -
UVA 674 Coin Change 钱币兑换问题 类似完全背包
题目:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=615虽然网上说这是基础题,感觉其实并不简单,虽然有人将此题归为完全背包,但感觉和经典的背包转移还是有些差别。dp[x][i]表示体积为x时的,前i种物原创 2015-12-02 16:42:05 · 416 阅读 · 0 评论 -
hdu 3466 Proud Merchants 01背包 (顺序性)
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3989 Accepted Submission(s): 1658Problem DescriptionRecently,原创 2015-12-04 13:26:36 · 381 阅读 · 0 评论 -
hdu 2126 Buy the souvenirs 01背包+计数dp
Buy the souvenirsTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1647 Accepted Submission(s): 606Problem DescriptionWhen the原创 2015-12-04 18:51:16 · 434 阅读 · 0 评论 -
uva 147 - Dollars 钱币兑换问题(浮点数) 精度问题 完全背包
题目:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=83&mosmsg=Submission+received+with+ID+16544004要对精度作出处理,其余和一般的钱币兑换问题一样。对于计数dp,一定要想到l原创 2015-12-06 15:31:25 · 540 阅读 · 0 评论 -
poj 3181 Dollar Dayz 钱币兑换问题 大数/高精度 完全背包
Dollar DayzTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5289 Accepted: 2006DescriptionFarmer John goes to Dollar Days at The Cow Store and discover原创 2015-12-06 18:35:53 · 544 阅读 · 0 评论 -
poj 3260 The Fewest Coins 混合背包+上限处理 ★★★
The Fewest CoinsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5872 Accepted: 1763DescriptionFarmer John has gone to town to buy some farm supplies.原创 2015-12-07 11:52:08 · 393 阅读 · 0 评论 -
poj 2063 Investment 贪心+完全背包
InvestmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9598 Accepted: 3335DescriptionJohn never knew he had a grand-uncle, until he received the no原创 2015-12-07 17:31:30 · 343 阅读 · 0 评论 -
ZOJ 3623 Battle Ships 造战舰炸塔 动态规划 伪装较好的完全背包 ★★★
Battle ShipsTime Limit: 2 Seconds Memory Limit: 65536 KB Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which hasL longev原创 2015-12-08 18:48:38 · 639 阅读 · 0 评论 -
hdu 3033 I love sneakers! 分组背包
终于写对了,明天写分析。。I love sneakers!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4785 Accepted Submission(s): 1957Problem Des原创 2016-01-04 21:34:21 · 369 阅读 · 0 评论