![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
文章平均质量分 80
坏坏的薯片
这个作者很懒,什么都没留下…
展开
-
hdu 1248 寒冰王座
问题描述不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!" 地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水350块一个." 死亡骑士:"好的,给我一个血瓶." 说完他掏出那张N元的大钞递给地精商原创 2015-12-26 01:17:37 · 327 阅读 · 0 评论 -
poj 3280 Cheapest Palindrome(区间dp)
问题描述Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the co原创 2016-06-21 19:49:38 · 188 阅读 · 0 评论 -
Milking Time --poj 3616(区间dp)
问题描述Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her nextN (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N-1原创 2016-06-21 10:41:58 · 256 阅读 · 0 评论 -
Apple Catching poj 2385(简单dp)
问题描述It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apples whe原创 2016-06-19 19:44:29 · 435 阅读 · 0 评论 -
poj 2836 Rectangular Covering(状压dp)
问题描述n points are given on the Cartesian plane. Now you have to use some rectangles whose sides are parallel to the axes to cover them. Every point must be covered. And a point can be covered by原创 2016-07-15 16:18:21 · 253 阅读 · 0 评论 -
Washing Clothes poj 3211(01背包)
问题描述Dearboy was so busy recently that now he has piles of clothes to wash. Luckily, he has a beautiful and hard-working girlfriend to help him. The clothes are in varieties of colors but each pi原创 2016-06-26 19:23:22 · 338 阅读 · 0 评论 -
Cash Machine poj 1276(多重背包)
问题描述A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, s原创 2016-06-26 17:18:15 · 177 阅读 · 0 评论 -
poj 1014(多重背包讲解)
问题描述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 marbles had th原创 2016-06-26 15:07:04 · 757 阅读 · 2 评论 -
Space Elevator poj 2392(多重背包)
问题描述The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build原创 2016-06-25 21:08:27 · 182 阅读 · 0 评论 -
Making the Grade poj 3666(离散化+滚动数组+dp)
问题描述A straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond of a原创 2016-06-25 19:20:27 · 255 阅读 · 0 评论 -
poj 2709 Sumsets
问题描述Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbe原创 2016-03-15 09:41:10 · 189 阅读 · 0 评论 -
poj 2393 Yogurt factory
问题描述The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cos原创 2016-03-22 08:37:26 · 583 阅读 · 0 评论 -
poj 3176 Cow Bowling
DescriptionThe cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:原创 2016-03-10 08:55:44 · 179 阅读 · 0 评论 -
hdu 2191 C - 悼念512汶川大地震遇难同胞――珍惜现在,感恩生活
问题描述急!灾区的食物依然短缺! 为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。请问:你用有限的资金最多能采购多少公斤粮食呢? 后记: 人生是一个充满了变数的生命过程,天灾、人祸、病痛是我们生命历程中不可预知的威胁。 月有阴晴圆缺,人有旦夕祸福原创 2015-12-27 23:34:30 · 785 阅读 · 0 评论 -
hdu 1171 D - Big Event in HDU
问题描述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 Software College in原创 2015-12-28 13:09:25 · 246 阅读 · 0 评论 -
hdu 2089 J - 不要62
问题描述杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如: 62315 73418 88914 都属于不吉利号码。但是,61152虽然含有6和2,但不是62连原创 2016-01-06 16:14:29 · 213 阅读 · 0 评论 -
hdu 3485 H - Count 101
问题描述You know YaoYao is fond of his chains. He has a lot of chains and each chain has n diamonds on it. There are two kinds of diamonds, labeled 0 and 1. We can write down the label of diamonds on原创 2016-01-05 13:00:34 · 263 阅读 · 0 评论 -
hdu 5045 F - Contest
问题描述In the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are given 5 hours to solve between 8 and 12 programming problems.On Mars, ther原创 2016-01-04 11:39:55 · 203 阅读 · 0 评论 -
hdu 1500 Chopsticks (dp)
DescriptionIn China, people use a pair of chopsticks to get food on the table, but Mr. L is a bit different. He uses a set of three chopsticks -- one pair, plus an EXTRA long chopstick to get some b原创 2016-08-01 16:17:55 · 292 阅读 · 0 评论