ACM__区间DP
文章平均质量分 78
wust_zwl
学不死,就往死里学。
展开
-
codeforces 191A Dynasty Puzzles(简单DP)
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of their kings. Th原创 2017-10-10 19:43:39 · 331 阅读 · 0 评论 -
POJ 3042 Grazing on the Run (三维区间DP)【区间DP模板】
A long, linear field has N (1 <= N <= 1,000) clumps of grass at unique integer locations on what will be treated as a number line.Think of the clumps as points on the number line. Bessie starts at some specified integer location L on the number line (1 <原创 2017-07-16 21:04:56 · 626 阅读 · 0 评论 -
UVA 1629 Cake slicing(四维DP)【分割格子类模板】
A rectangular cake with a grid of m*n unit squares on its top needs to be sliced into pieces. Several cherries are scattered on the top of the cake with at most one cherry on a unit square. The slicing should follow the rules below: 1. each piece is rect原创 2017-07-17 09:57:06 · 530 阅读 · 0 评论 -
HDU 5067 Harry And Dig Machine(动态规划+位运算)【双调欧几里得类模板】
As we all know, Harry Porter learns magic at Hogwarts School. However, learning magical knowledge alone is insufficient to become a great magician. Sometimes, Harry also has to gain knowledge from other certain subjects, such as language, mathematics, Engl原创 2017-07-17 15:14:49 · 391 阅读 · 0 评论 -
POJ 2677 Tour(动态规划+双调欧几里得旅行商算法)【模板】
John Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must determine the shortest closed tour that connects his destinations. Each destination is represented by a po转载 2017-07-15 19:37:14 · 517 阅读 · 0 评论 -
POJ 2241 The Tower of Babylon(动态规划)【DP--长方体类模板】
Perhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this talehave been forgotten. So now, in line with the educational nature of this contest, we will tell you thewhole story:The babylonians had n types of blocks, and原创 2017-07-12 16:27:57 · 425 阅读 · 0 评论 -
HDU 1074 Doing Homework (状态压缩DP+位运算)【一维状压--期限类模板】
Ignatius 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 homework after the deadline, the teacher will reduce his score of the fin原创 2017-07-25 10:25:30 · 316 阅读 · 0 评论 -
WUST 1846 营养膳食(贪心)【简单贪心类模板】
阿月正在女朋友宁宁的监督下完成自己的增肥计划。 为了增肥,阿月希望吃到更多的脂肪。然而也不能只吃高脂肪食品,那样的话就会导致缺少其他营养。阿月通过研究发现:真正的营养膳食规定某类食品不宜一次性吃超过若干份。比如就一顿饭来说,肉类不宜吃超过1份,鱼类不宜吃超过1份,蛋类不宜吃超过1份,蔬菜类不宜吃超过2份。阿月想要在营养膳食的情况下吃到更多的脂肪,当然阿月的食量也是有限的。原创 2017-07-25 20:51:06 · 1347 阅读 · 0 评论 -
ZOJ 3802 Easy 2048 Again(状压DP+位运算)【一维状压类模板--2048】
Dark_sun knows that on a single-track road (which means once he passed this area, he cannot come back again), there are some underground treasures on each area of the road which has the value of 2, 4, 8 or 16. Dark_sun can decide whether to dig them or not原创 2017-07-27 09:10:00 · 394 阅读 · 0 评论 -
wust oj 1867 (输出最长不下降子序列)【最长序列输出类模板】
设有由n个不相同的整数组成的数列,记为:b(1)、b(2)、……、b(n)且b(i)<>b(j) (i<>j),若存在i1<i2<i3< … < ie 且有b(i1)<b(i2)< … <b(ie)则称为长度为e的不下降序列。程序要求,当原数列出之后,求出最长的不下降序列。 例如13,7,9,16,38,24,37,18,44,19,21,22,63,15。例中13,16,18,19,21,22,63就是一个长度为7的不下降序列,同时也有7 ,9,16,18,19,21,22,63长度为8的原创 2017-07-26 20:28:29 · 1782 阅读 · 0 评论 -
HDU 1114 Piggy-Bank(完全背包问题)【完全背包--刚好装满 模板】
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). The idea behind is simple. Whenever some ACM member has any small money, he takes原创 2017-07-27 10:41:26 · 656 阅读 · 0 评论 -
UVA Problem 10003 Cutting Sticks (切割木棍)
Emma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they only have two compact cars, which complicates everything a bit. Since the原创 2017-07-14 16:22:51 · 305 阅读 · 0 评论 -
POJ 2955 Brackets(区间dp)【括号弧模板】
We give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence,if s is a regular brackets sequence, then (s) and [s] are regular brackets sequences, andif a and b are regular brackets seque原创 2017-08-11 16:11:25 · 281 阅读 · 0 评论 -
ZOJ 3446 Doraemon's Battle (三维dp+BFS)【打怪类模板】
Doraemon is fighting with n enemies.Doraemon has two properties in this battle, HP and SP. HP is the health point of Doraemon with initial value lh. If Doraemon's HP decreased to 0 or lower, Doraemon will lose the battle. SP is a property for using Dorae原创 2017-08-18 11:05:48 · 318 阅读 · 0 评论 -
codeforces 165E Compatible Numbers(位运算)【模板】
Two integers x and y are compatible, if the result of their bitwise "AND" equals zero, that is, a & b = 0. For example, numbers 90 (10110102) and 36 (1001002) are compatible, as 10110102 & 1001002 = 02, and numbers 3 (112) and 6 (1102) are not compatible,原创 2017-08-03 20:04:58 · 697 阅读 · 1 评论 -
HDU 3008 Warcraft (动态规划)【打怪类】
Have 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 them.Each Hero has his own skills.When such a Skill is used ,it costs some M原创 2017-07-15 15:37:00 · 753 阅读 · 0 评论 -
HDU 5119 Happy Matt Friends(动态规划)【状压基础类模板】
att has N friends. They are playing a game together. Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (exclusive-or) sum of the selected friends’magic numbers is no less than M , Matt wi原创 2017-07-15 13:55:59 · 381 阅读 · 0 评论 -
codeforces 182E Wooden Fence(方案数DP)【模板】
Vasya has recently bought some land and decided to surround it with a wooden fence.He went to a company called "Wooden board" that produces wooden boards for fences. Vasya read in the catalog of pro原创 2017-08-14 09:03:29 · 344 阅读 · 0 评论 -
HDU 4734 F(x) (数位DP)
For a decimal number x with n digits (A nA n-1A n-2 ... A 2A 1), we define its weight as F(x) = A n * 2 n-1 + A n-1 * 2 n-2 + ... + A 2 * 2 + A 1 * 1. Now you are given two numbers A and B, please calculate how many numbers are there between 0 and B, inclu原创 2017-08-29 09:41:21 · 664 阅读 · 0 评论 -
HDU 3652 B-number(数位DP)
A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. Your task is to calculate how many wqb-numbers fr原创 2017-08-28 19:34:51 · 338 阅读 · 0 评论 -
HDU 2089 不要62 (数位dp)
杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。 不吉利的数字为所有含有4或62的号码。例如: 62315 73418 88914 都属于不吉利号码。但是,61152虽然含有6和2,但不是62连号,所以不属于不吉利数字之列。 你的任务是,对于每次给出的一个牌照区间号,推断出交管局今次又要实际上给多少辆新的士车上牌照了。原创 2017-08-24 09:39:54 · 244 阅读 · 0 评论 -
UVA 11375 Matches (dp+高精度)【模板】
We can make digits with matches as shown below:Given N matches, find the number of different numbers representable using the matches. We shallonly make numbers greater than or equal to 0, so no negative signs should be used. For instance, ifyou have 3 ma原创 2017-08-22 19:57:09 · 338 阅读 · 0 评论 -
codeforces 5C Longest Regular Bracket Sequence(dp+技巧)【最长连续括号模板】
This is yet another problem dealing with regular bracket sequences.We should remind you that a bracket sequence is called regular, if by inserting «+» and «1» into it we can get a correct mathematical expression. For example, sequences «(())()», «()» and原创 2017-08-11 10:47:34 · 765 阅读 · 0 评论 -
HDU 3401 Trade(单调队列优化DP)【模板】
Recently, lxhgww is addicted to stock, he finds some regular patterns after a few days' study. He forecasts the next T days' stock market. On the i'th day, you can buy one stock with the price APi or sell one stock to get BPi. There are some other limits原创 2017-08-07 21:03:20 · 454 阅读 · 0 评论 -
单调队列优化DP详解
细说单调队列优化dp原理及效率提升对比~转载 2017-08-07 10:14:49 · 2834 阅读 · 0 评论 -
HDU 3280 Equal Sum Partitions(区间DP)【模板】
An equal sum partition of a sequence of numbers is a grouping of the numbers (in the same order as the original sequence) in such a way that each group has the same sum. For example, the sequence: 2 5 1 3 3 7 may be grouped as: (2 5) (1 3 3) (7) to yie原创 2017-08-06 19:02:55 · 355 阅读 · 0 评论 -
codeforces 182E Wooden Fence(方案数DP)【模板】
Vasya has recently bought some land and decided to surround it with a wooden fence.He went to a company called "Wooden board" that produces wooden boards for fences. Vasya read in the catalog of products that the company has at its disposal n different t原创 2017-08-14 09:16:32 · 411 阅读 · 0 评论 -
wust oj 1891 低价购买(最长下降子序列+方案数)【模板】
“低价购买”这条建议是在股票市场取得成功的一半规则。要想被认为是伟大的投资者,你必须遵循以下的购买建议:“低价购买;再低价购买”。每次你购买一支股票,你必须用低于你上次购买它的价格购买它。买的次数越多越好!你的目标是在遵循以上建议的前提下,求你最多能购买股票的次数。你将被给出一段时间内一支股票每天的出售价(216范围内的正整数),你可以选择在哪些天购买这支股票。每次购买都必须遵循“低价购买;再低价购买”的原则。写一个程序计算最大购买次数。这里是某支股票的价格清单:日期 1 2 3 4 5 6原创 2017-08-13 10:02:44 · 366 阅读 · 0 评论 -
HDU 1176 免费馅饼(DP)
都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特别迟钝,每秒种只有在移动不超过一米的范围内接住坠落的馅饼。现在给这条小径如图标上坐标:原创 2017-07-28 10:46:31 · 260 阅读 · 0 评论 -
CodeForces - 391B Word Folding(题目超难题解超简单的DP)
You will receive 5 points for solving this problem.Manao has invented a new operation on strings that is called folding. Each fold happens between a pair of consecutive letters and places the second part of the string above first part, running in the opp原创 2017-07-27 22:25:32 · 507 阅读 · 0 评论 -
POJ 1088 滑雪(经典二维动态规划)【模板】
Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12 11 10 9一个人可以从某个点滑向上下左右相邻四个点之一,当且仅当高度减小。在上面的例子中,一条可滑行的滑原创 2017-07-12 21:17:44 · 241 阅读 · 0 评论 -
2015 UESTC Training for Dynamic Programming 男神的礼物(区间dp)
Lweb学长是集训队里公认的男神。有一天他要给美美的学姐姐准备礼物。Lweb学长可是会魔法的哟。为了准备一份礼物,男神要加工n份材料。每一次只能加工相邻的材料。当男神加工两个魔法值为a,b的材料,男神都要消耗a*b的体力,同时在这个地方合成出魔法值(a+b)%100的材料。男神为了能节省体力来完成他的礼物。想找聪明的你帮他算一算他所要花费的最小体力。原创 2017-08-10 10:29:53 · 256 阅读 · 0 评论 -
HDU 5115 Dire Wolf(区间DP)
Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor. Dire wolves look like normal wolves, but these creatures are of nearly twice the size. These powerful be原创 2017-08-10 08:52:30 · 370 阅读 · 0 评论 -
POJ 1050 To the Max(最大字矩阵)【模板】
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the原创 2017-08-07 20:12:06 · 227 阅读 · 0 评论 -
POJ 1018 Communication System(动态规划)
We have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several manufacturers. Same devices from two manufacturers differ in their max原创 2017-08-07 19:04:23 · 430 阅读 · 0 评论 -
Codeforces 8C Looking for Order(状态压缩DP)
Girl Lena likes it when everything is in order, and looks for order everywhere. Once she was getting ready for the University and noticed that the room was in a mess — all the objects from her handbag were thrown about the room. Of course, she wanted to pu原创 2017-07-31 19:49:52 · 411 阅读 · 0 评论 -
codeforces 264B Good Sequences(DP+灵活思维)【最长不互质序列模板】
Squirrel Liss is interested in sequences. She also has preferences of integers. She thinks n integers a1, a2, ..., an are good.Now she is interested in good sequences. A sequence x1, x2, ..., xk is called good if it satisfies the following three conditio原创 2017-07-30 20:27:17 · 1302 阅读 · 0 评论 -
HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列求和)【最长序列求和类模板】
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-07-27 09:20:10 · 357 阅读 · 0 评论 -
OpenJ_Bailian - 2757 最长上升子序列(O(n2)算法和O(nlogn)算法)
一个数的序列 bi,当 b1 < b2 < ... < bS的时候,我们称这个序列是上升的。对于给定的一个序列( a1, a2, ..., aN),我们可以得到一些上升的子序列( ai1, ai2, ..., aiK),这里1 <= i1 < i2 < ... < iK <= N。比如,对于序列(1, 7, 3, 5, 9, 4, 8),有它的一些上升子序列,如(1, 7), (3, 4, 8)等等。这些子序列中最长的长度是4,比如子序列(1, 3, 5, 8). 你的任务,就是对于给定的序列,求出最长原创 2017-07-17 17:37:57 · 449 阅读 · 0 评论 -
POJ 1661 Help Jimmy(动态规划--最短下降模板)
"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。 Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy落到某个平台上时,游戏者选择让它向左还是向右跑,它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时,开始继续下落。Jimmy每次下落的高度不能超过MAX米,不然就会摔死,游戏也会结束。 设计一个程序,计算Jimmy到底地面时可能的最早时间。原创 2017-07-29 22:16:50 · 338 阅读 · 0 评论