dp
文章平均质量分 80
小纪萱苏
这个作者很懒,什么都没留下…
展开
-
hdu 2571 命运
Description穿过幽谷意味着离大魔王lemon已经无限接近了! 可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又一个机关。要知道,不论何人,若在迷宫中被困1小时以上,则必死无疑!可怜的yifenfei为了去救MM,义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧!命运大迷宫可以看成是一个两维的方格阵列,如下图所示:原创 2016-02-24 20:28:21 · 195 阅读 · 0 评论 -
hdu 2830 Matrix Swapping II
DescriptionGiven an N * M matrix with each entry equal to 0 or 1. We can find some rectangles in the matrix whose entries are all 1, and we define the maximum area of such rectangle as this matrix’s原创 2016-02-26 16:37:29 · 298 阅读 · 0 评论 -
hdu 3008 Warcraft
DescriptionHave you ever played the Warcraft?It doesn't matter whether you have played it !We will give you such an experience.There are so many Heroes in it,but you could only choose one of the原创 2016-03-12 10:03:23 · 383 阅读 · 0 评论 -
hdu 1300 pearls
DescriptionIn Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to the royal f原创 2016-03-12 10:11:29 · 266 阅读 · 0 评论 -
poj 1185 炮兵阵地
炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22810 Accepted: 8830Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能原创 2016-01-28 12:17:33 · 273 阅读 · 0 评论 -
poj 3254 Corn Fields
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11000 Accepted: 5773DescriptionFarmer John has purchased a lush new rectangular pasture compo原创 2016-01-29 16:08:37 · 193 阅读 · 0 评论 -
zoj 3471Running
DescriptionThe cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 ≤ N ≤ 10,000) minutes. During each minute, she can choose to either run or rest for the who原创 2016-01-30 10:42:51 · 216 阅读 · 0 评论 -
hdu 1074 doing homework(状态压缩dp)
DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the home原创 2016-02-27 15:28:52 · 249 阅读 · 0 评论 -
hdu 1158 Employment Planning
DescriptionA project manager wants to determine the number of the workers needed in every month. He does know the minimal number of the workers needed in each month. When he hires or fires a worker,原创 2016-02-27 17:38:55 · 209 阅读 · 0 评论 -
hdu 2639 Bone Collector II
Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't mat原创 2016-02-26 14:33:59 · 187 阅读 · 0 评论 -
hdu 2602 Bone Collector
DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …The原创 2016-02-26 10:16:35 · 180 阅读 · 0 评论 -
hdu 1257 最少拦截系统
Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹. 怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一原创 2016-02-24 20:33:40 · 205 阅读 · 0 评论 -
hdu 1248 寒冰王座
Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前. 死亡骑士:"我要买道具!" 地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水350块一个." 死亡骑士:"好的,给我一个血瓶." 说完他掏出那张N元的大钞递原创 2016-02-24 20:37:04 · 216 阅读 · 0 评论 -
hdu 2546 饭卡
Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的余额,问最少可使卡上的余额为多少。 Input多组数据。原创 2016-02-24 20:41:28 · 212 阅读 · 0 评论 -
hdu 2191 悼念512汶川大地震遇难同胞――珍惜现在,感恩生活
急!灾区的食物依然短缺! 为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。请问:你用有限的资金最多能采购多少公斤粮食呢? 后记: 人生是一个充满了变数的生命过程,天灾、人祸、病痛是我们生命历程中不可预知的威胁。 月有阴晴圆缺,人有旦夕祸福,未来对于我们而原创 2016-02-24 20:44:29 · 245 阅读 · 0 评论 -
hdu 2084 数塔
Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的: 有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少? 已经告诉你了,这是个DP的题目,你能AC吗?Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1 <= N <= 100),表示数原创 2016-02-24 20:48:10 · 227 阅读 · 0 评论 -
hdu 1241 搬寝室
Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度是和左右手的物品的重原创 2016-02-25 14:32:33 · 231 阅读 · 0 评论 -
hdu 2844 Coins
DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby s原创 2016-02-25 20:30:18 · 200 阅读 · 0 评论 -
hdu 1864 最大报销额
Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类)、文具(B类)、差旅(C类),要求每张发票的总额不得超过1000元,每张发票上,单项物品的价值不得超过600元。现请你编写程序,在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。Input测试输入包含若干测试用例。每个测试用例的第1行包含两个正数 Q 和 N原创 2016-02-25 20:43:42 · 205 阅读 · 0 评论 -
codeforces 55D Beautiful numbers(数位DP)
DescriptionVolodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will原创 2016-07-28 16:54:43 · 293 阅读 · 0 评论