![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DP
小伙子开的什么车啊
这个作者很懒,什么都没留下…
展开
-
【数位DP】不要62 (入门)
Problem Description 杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。 不吉利的数字为所有含有4或62的号码。例如: 62315 73418 88914 都属于不吉利号码。但是,61152虽然含有原创 2018-01-12 09:11:28 · 518 阅读 · 0 评论 -
HDOJ 1069 Monkey and Banana DP
Problem Description A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with s原创 2017-07-10 20:41:04 · 382 阅读 · 0 评论 -
HDOJ 1078 FatMouse and Cheese (DFS+DP)
Problem Description FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e原创 2017-07-10 20:52:40 · 205 阅读 · 0 评论 -
HDOJ 1087 Super Jumping! Jumping! Jumping! (DP)
Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to原创 2017-07-10 21:01:57 · 218 阅读 · 0 评论 -
HDOJ 1114 Piggy-Bank (DP)
Problem Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). Th原创 2017-07-10 21:13:40 · 246 阅读 · 0 评论 -
HDOJ 1171 Big Event in HDU(二进制拆分+0 1背包)
Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Softw原创 2017-07-11 09:34:42 · 199 阅读 · 0 评论 -
HDOJ 1176 免费馅饼(DP)
Problem Description 都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中原创 2017-07-11 09:41:45 · 238 阅读 · 0 评论 -
HDOJ 1203 I NEED A OFFER!(0 1背包)
Problem Description Speakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了原创 2017-07-11 09:45:43 · 311 阅读 · 0 评论 -
HDOJ 1224 Free DIY Tour(DP)
Problem Description Weiwei is a software engineer of ShiningSoft. He has just excellently fulfilled a software project with his fellow workers. His boss is so satisfied with their job that he decid原创 2017-07-11 09:51:39 · 212 阅读 · 0 评论 -
HDOJ 1257 最少拦截系统(最长递增子序列)
Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹. 怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里原创 2017-07-11 10:06:55 · 270 阅读 · 0 评论 -
【状压DP】 Mondriaan's Dream(入门)
Problem Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper t原创 2018-01-10 21:09:50 · 258 阅读 · 0 评论 -
HDOJ 1059 Dividing(多重背包+二进制优化)
Problem Description Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the原创 2017-07-10 20:14:15 · 443 阅读 · 1 评论