动态规划
文章平均质量分 78
wust_cyl
在非洲,瞪羚每天早上醒来时,他知道自己必须跑的比最快的狮子还快,否则就会被吃掉.狮子每天早上醒来时,他知道自己必须追上跑得最慢的瞪羚,否则就会被饿死.不管你是狮子还是瞪羚,当太阳升起时,你最好开始奔跑
展开
-
NYOJ 16 (动态规划之嵌套矩形)
问题描述:描述有n个矩形,每个矩形可以用a,b来描述,表示长和宽。矩形X(a,b)可以嵌套在矩形Y(c,d)中当且仅当a输入第一行是一个正正数N(0每组测试数据的第一行是一个正正数n,表示该组测试数据中含有矩形的个数(n随后的n行,每行有两个数a,b(0输出每组测试数据都输出一个数,表示最多符合条件的矩形数目,每组输出占一行样例输入1101 22 45 86原创 2017-10-07 16:52:44 · 350 阅读 · 0 评论 -
CodeForces 148E(动态规划)
问题描述:During her tantrums the princess usually smashes some collectable porcelain. Every furious shriek is accompanied with one item smashed.The collection of porcelain is arranged neatly on n sh原创 2017-12-06 23:19:28 · 327 阅读 · 0 评论 -
HDU 1978(动态规划)
问题描述这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下: 1.机器人一开始在棋盘的起始点并有起始点所标有的能量。 2.机器人只能向右或者向下走,并且每走一步消耗一单位能量。 3.机器人不能在原地停留。 4.当机器人选择了一条可行路径后,当他走到这条路径的终点时,他将只有终点所标记的能量。如上图,机原创 2017-12-16 22:59:26 · 269 阅读 · 0 评论 -
HDU 1224(动态规划)
问题描述: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 decide to provide the原创 2018-01-11 22:24:10 · 544 阅读 · 0 评论 -
HDU 4540(动态规划)
问题描述:威威猫最近不务正业,每天沉迷于游戏“打地鼠”。 每当朋友们劝他别太着迷游戏,应该好好工作的时候,他总是说,我是威威猫,猫打老鼠就是我的工作! 无话可说... 我们知道,打地鼠是一款经典小游戏,规则很简单:每隔一个时间段就会从地下冒出一只或多只地鼠,玩游戏的人要做的就是打地鼠。 假设: 1、每一个时刻我们只能打一只地鼠,并且打完以后原创 2018-01-21 12:08:18 · 219 阅读 · 0 评论 -
HDU 5418(动态规划-状压dp+floyd算法)
问题描述:After trying hard for many years, Victor has finally received a pilot license. To have a celebration, he intends to buy himself an airplane and fly around the world. There are nn countries on原创 2018-01-21 12:18:52 · 300 阅读 · 0 评论 -
CodeForces 189D(最短路+dp)
问题描述:PMP is getting a warrior. He is practicing a lot, but the results are not acceptable yet. This time instead of programming contests, he decided to compete in a car racing to increase the spirit o...原创 2018-04-02 08:07:44 · 372 阅读 · 0 评论 -
HDU 3091(动态规划-状态压缩)
问题描述:One day , Partychen gets several beads , he wants to make these beads a necklace . But not every beads can link to each other, every bead should link to some particular bead(s). Now , Partychen原创 2018-01-15 21:48:44 · 300 阅读 · 0 评论 -
HDU 1081(动态规划-最大和子矩阵)
问题描述:Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. The sum of a rectangle is t原创 2018-01-07 16:15:10 · 209 阅读 · 0 评论 -
HDU 1158(动态规划)
问题描述:A 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, there原创 2018-01-07 20:52:43 · 359 阅读 · 0 评论 -
HDU 1059(动态规划-多重组合)
问题描述: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 the原创 2018-01-08 12:45:24 · 285 阅读 · 0 评论 -
POJ 3254(动态规划-状压dp)
问题描述:Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regre原创 2018-01-17 23:36:53 · 307 阅读 · 0 评论 -
HDU 5691(动态规划-状压dp)
问题描述:度度熊是他同时代中最伟大的数学家,一切数字都要听命于他。现在,又到了度度熊和他的数字仆人们玩排排坐游戏的时候了。游戏的规则十分简单,参与游戏的N个整数将会做成一排,他们将通过不断交换自己的位置,最终达到所有相邻两数乘积的和最大的目的,参与游戏的数字有整数也有负数。度度熊为了在他的数字仆人面前展现他的权威,他规定某些数字只能在坐固定的位置上,没有被度度熊限制的数字则可以自由地交换位置。原创 2018-01-26 19:27:22 · 260 阅读 · 0 评论 -
CodeForces 11D(动态规划-状压dp)
问题描述:Given a simple graph, output the number of simple cycles in it. A simple cycle is a cycle with no repeated vertices or edges.InputThe first line of input contains two integers n and m (原创 2018-01-18 22:35:41 · 524 阅读 · 0 评论 -
POJ 1185(动态规划-状压dp)
问题描述:司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示: 如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色的网格表示它能够攻原创 2018-01-27 21:26:28 · 213 阅读 · 0 评论 -
CodeForces 120F(树形DP-树上最长距离)
问题描述:One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya con原创 2018-01-28 15:40:30 · 277 阅读 · 0 评论 -
HDU 4628(动态规划-状压dp)
问题描述:You heart broke into pieces.My string broke into pieces.But you will recover one day,and my string will never go back. Given a string s.We can erase a subsequence of it if this subsequence is原创 2018-01-20 18:17:15 · 496 阅读 · 0 评论 -
hdu 4722(动态规划-数位dp)
问题描述:If we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number. You are required to count the number of good numbers in the range from A to ...原创 2018-02-24 18:27:26 · 263 阅读 · 0 评论 -
URAL 1057 (数位dp)
问题描述:Create a code to determine the amount of integers, lying in the set [ X; Y] and being a sum of exactly K different integer degrees of B.Example. Let X=15, Y=20, K=2, B=2. By this exam转载 2017-12-05 14:22:56 · 465 阅读 · 0 评论 -
URAL 1036(数位dp)
问题描述:You are given a number 1 ≤ N ≤ 50. Every ticket has its 2 N-digit number. We call a ticket lucky, if the sum of its first N digits is equal to the sum of its last Ndigits. You are also given th原创 2017-12-05 14:08:00 · 251 阅读 · 0 评论 -
HDU 1160(动态规划-最长上升子序列)
问题描述:FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a s原创 2017-12-21 16:36:58 · 319 阅读 · 0 评论 -
UVA 116(单向TSP)
题目来源:点击打开链接题目题意:题目给我们一个m*n的数阵,我们从第一列的任何位置出发,每次只能向右,右上,右下前进,到达最后一列,且矩阵式环形的,求经过路径的数字之和最小并输出路径(每一列的行数)如果有多解,输出字典序最小的。题目分析:每一列就是一个阶段,每个阶段有三个决策,向右,右上,右下前进。我们从最后一列出发,依据已有的结果求出下一个阶段的最优解,d(i,j)表示的是从这里出发的最原创 2017-10-07 18:42:19 · 270 阅读 · 0 评论 -
HDU 1087(动态规划-最大上升序列)
问题描述: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 you now.原创 2017-10-27 09:36:11 · 240 阅读 · 0 评论 -
HDU 2571(动态规划)
问题描述:穿过幽谷意味着离大魔王lemon已经无限接近了! 可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又一个机关。要知道,不论何人,若在迷宫中被困1小时以上,则必死无疑! 可怜的yifenfei为了去救MM,义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧! 命运大迷宫可以看成是一个两维的方格阵列,如下图所示:原创 2017-10-27 23:20:20 · 260 阅读 · 0 评论 -
HDU 1069(动态规划)
问题描述: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 some blocks. If t原创 2017-10-28 15:29:18 · 314 阅读 · 0 评论 -
HDU 1176(动态规划)
问题描述:都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运原创 2017-10-28 22:27:33 · 286 阅读 · 0 评论 -
HDU 2955 (动态规划-01背包)
问题描述:The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lu原创 2017-10-21 08:42:09 · 299 阅读 · 0 评论 -
HDU 1864(动态规划-01背包)
问题描述:现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类)、文具(B类)、差旅(C类),要求每张发票的总额不得超过1000元,每张发票上,单项物品的价值不得超过600元。现请你编写程序,在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。 Input测试输入包含若干测试用例。每个测试用例的第1行包含两个正数 Q 和 N,其中 Q 是给定的报销额原创 2017-10-22 10:23:12 · 226 阅读 · 0 评论 -
HDU 2159(动态规划-完全背包)
问题描述:最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感,但又不得不通过杀怪来升完这最后一级。现在的问题是,xhd升掉最后一级还需n的经验值,xhd还留有m的忍耐度,每杀一个怪xhd会得到相应的经验,并减掉相应的忍耐度。当忍耐度降到0或者0以下时,xhd就不会玩这游戏。xhd还说了他最多只杀s只怪。请问他能升掉这最后一级原创 2017-11-02 08:07:21 · 291 阅读 · 0 评论 -
HDU 1159(动态规划-最长公共子序列)
问题描述:A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exists a strictly原创 2017-11-02 08:10:22 · 236 阅读 · 0 评论 -
HDU 1421(动态规划)
问题描述:搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度是和左右手的物品的重量差的平方成原创 2017-11-11 17:57:16 · 261 阅读 · 0 评论 -
HDU 1231(动态规划)
问题描述:给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj },其中 1 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为20。 在今年的数据结构考卷中,要求编写程序得到最大和,现在增加一个要求,即还需要输出该 子序列的第一个和原创 2017-10-25 21:24:38 · 256 阅读 · 0 评论 -
HDU 1003(动态规划-最大连续区间和)
问题描述:Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. I原创 2017-10-25 21:54:18 · 526 阅读 · 0 评论 -
HDU 1506(动态规划)
问题描述:A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left原创 2017-10-26 11:05:44 · 703 阅读 · 0 评论 -
HDU 1505(动态规划-最大子矩阵)
问题描述:Bob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees,factories and b原创 2017-10-26 14:00:18 · 221 阅读 · 0 评论 -
HDU 2830(动态规划)
问题描述:Given 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 goodn原创 2017-11-16 12:06:46 · 428 阅读 · 0 评论 -
HDU 2845(动态规划-最大非连续区间)
问题描述:Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 grid. Now you want to eat the beans原创 2017-11-16 18:54:15 · 304 阅读 · 0 评论 -
HDU 2870(动态规划-最大子矩阵)
问题描述:Now here is a matrix with letter 'a','b','c','w','x','y','z' and you can change 'w' to 'a' or 'b', change 'x' to 'b' or 'c', change 'y' to 'a' or 'c', and change 'z' to 'a', 'b' or 'c'. After y原创 2017-11-23 11:09:28 · 415 阅读 · 0 评论 -
POJ 2411 (动态规划-状压DP AND 轮廓线DP)
问题描述: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 to draw on, for all...原创 2018-03-13 20:37:04 · 436 阅读 · 0 评论