动态规划
文章平均质量分 52
动态规划
Herod_
这个作者很懒,什么都没留下…
展开
-
Codeforces 1272F. Two Bracket Sequences(BFS+DP+路径记忆)
Codeforces Round #605 (Div. 3) 题解全文见: https://blog.csdn.net/qq_43461168/article/details/114377042F. Two Bracket Sequences题意:给出两个括号串,求一个最短的括号串,使得这两个串都是他的子序列。思路:参考官方题解。BFS+DP。用dp[i][j][d]表示包含s1的前i个,s2的前j个,且度为d的情况下的最小长度。 度定义为 左括号的数量-右括号的数量。转移呢,肯定是从 dp[0][0原创 2021-03-04 21:56:28 · 211 阅读 · 1 评论 -
HDU-2110-Crisis of HDU(母函数/完全背包)
Crisis of HDUProblem Description话说上回讲到HDU大战东洋小苟,结果自然是中方大胜,这一战也使得海东集团在全球同行业中的地位更加巩固。随着集团的发展,很多创业时期的元老逐步功成身退,先是8600移民海外,然后是linle夫妇退隐山林,逐渐的,最初众多的元老只剩下XHD夫妇和Wiskey三人了。到了2020年,因为扩张过度加上老鼠数量逐年减少,公司的发展遇到了前所未有的危机,此时集团已经没有任何流动资金,更可怕的是,这个时候,wiskey也决定退出了!退出本身并不麻烦,原创 2020-09-04 01:58:36 · 186 阅读 · 0 评论 -
HDU-1028- Ignatius and the Princess III(完全背包/母函数)
Ignatius and the Princess IIIProblem Description“Well, it seems the first problem is too easy. I will let you know how foolish you are later.” feng5166 says.“The second problem is, given an positive integer N, we define an equation like this:N=a[1]+a[2原创 2020-09-03 23:30:29 · 184 阅读 · 0 评论 -
POJ-2184-Cow Exhibition(负容量01背包)
Cow Exhibition“Fat and docile, big and dumb, they look so stupid, they aren’t muchfun…”Cows with Guns by Dana LyonsThe cows want to prove to the public that they are both smart and fun. In order to do this, Bessie has organized an exhibition that wil原创 2020-09-02 14:10:05 · 175 阅读 · 0 评论 -
2019 ICPC 银川 A. Girls Band Party(分组背包)
题意:有n张卡片,每张卡片三个属性,name,color,value。现在要打出5张卡片,要求名字不能相同(题目保证有解)。求最大的value和。还有两个条件,题目给出五个名字,出现这些名字一次 加 10%的总分以及给出一个color,出现一次这个color 加20%总分求最大value思路:因为每个名字只能选一次。所以可以用分组背包把同一个名字的放在同一组进行枚举。然后还有加成这一属性,也放到dp数组的状态里面去。dp[i][j][k] 表示前i组 选了j张卡片 且 加成为k 时的最原创 2020-08-24 23:30:45 · 546 阅读 · 0 评论 -
2019 ICPC Yokohama H-Parentheses Editor(DP+栈 正解!)
You are working with a strange text editor for texts consisting only of open and close parentheses. The editor accepts the following three keys as editing commands to modify the text kept in it.‘(’ appends an open parenthesis (‘(’) to the end of the text.原创 2020-08-22 17:40:47 · 291 阅读 · 0 评论 -
HDU 1712 ACboy needs your help(分组背包)
ACboy needs your helpProblem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the N courses原创 2020-08-21 20:47:26 · 145 阅读 · 0 评论 -
HDU-1565-方格取数(1)(状压DP)
方格取数(1)Problem Description给你一个n*n的格子的棋盘,每个格子里面有一个非负数。从中取出若干个数,使得任意的两个数所在的格子没有公共边,就是说所取的数所在的2个格子不能相邻,并且取出的数的和最大。Input包括多个测试实例,每个测试实例包括一个整数n 和n*n个非负数(n<=20)Output对于每个测试实例,输出可能取得的最大的和Sample In...原创 2020-02-02 15:46:37 · 201 阅读 · 0 评论 -
HDU-1950-Bridging signals(nlogn 的LIS)
HDU-1950-LIS(nlogn)#include<stdio.h>#include<algorithm>using namespace std;int main(){ int T,p,i,x,top; scanf("%d",&T); while(T--){ scanf("%d",&p); ...原创 2019-12-02 17:00:48 · 135 阅读 · 0 评论 -
HDU-1422-重温世界杯(仿佛是个DP)
重温世界杯Problem Description世界杯结束了,意大利人连本带利的收回了法国人6年前欠他们的债,捧起了大力神杯,成就了4星意大利.世界杯虽然结束了,但是这界世界杯给我们还是留下许多值得回忆的东西.比如我们听到了黄名嘴的3分钟激情解说,我们懂得了原来可以向同一个人出示3张黄牌,我们还看到了齐达内的头不仅能顶球还能顶人…………介于有这么多的精彩,xhd决定重温德国世界杯,当然只是...原创 2019-10-08 20:51:06 · 80 阅读 · 0 评论 -
SGU495Kids and Prizes(可能是最简单的概率DP了)
Kids and PrizesICPC (International Cardboard Producing Company) is in the business of producing cardboard boxes. Recently the company organized a contest for kids for the best design of a cardboard box and selected M winners. There are N prizes for the .原创 2020-08-19 23:30:43 · 463 阅读 · 1 评论 -
POJ-2411-Mondriaan's Dream(状压DP)
Mondriaan’s DreamSquares 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 dra...原创 2020-02-08 12:10:46 · 192 阅读 · 0 评论 -
POJ-2955-Brackets(区间DP)
BracketsWe 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 regul...原创 2020-02-07 19:27:27 · 186 阅读 · 0 评论 -
POJ-1651-Multiplication Puzzle(区间DP)
Multiplication PuzzleThe multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of ...原创 2020-02-07 19:23:28 · 239 阅读 · 0 评论 -
51Nod-1021-石子归并(区间DP入门)
石子归并Problem DescriptionN堆石子摆成一条线。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的代价。计算将N堆石子合并成一堆的最小代价。例如: 1 2 3 4,有不少合并方法1 2 3 4 => 3 3 4(3) => 6 4(9) => 10(19)1 2 3 4 => 1 5 4(5...原创 2020-02-07 19:18:19 · 143 阅读 · 0 评论 -
POJ-1185-炮兵阵地(状压DP)
炮兵阵地司令部的将军们打算在NM的网格地图上部署他们的炮兵部队。一个NM的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示:如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色的网格表示它能够攻击到的区域:沿横向左...原创 2020-02-05 22:25:32 · 196 阅读 · 0 评论 -
洛谷-P1896 [SCOI2005]互不侵犯(状压DP || DFS)
题目描述在N×N的棋盘里面放K个国王,使他们互不攻击,共有多少种摆放方案。国王能攻击到它上下左右,以及左上左下右上右下八个方向上附近的各一个格子,共8个格子。注:数据有加强(2018/4/25)输入格式只有一行,包含两个数N,K ( 1 <=N <=9, 0 <= K <= N * N)输出格式所得的方案数输入 #13 2输出 #116解题思路:...原创 2019-12-10 19:20:28 · 257 阅读 · 1 评论 -
洛谷-P1879 [USACO06NOV]玉米田Corn Fields(状压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. Regretta...原创 2019-12-10 16:38:52 · 140 阅读 · 0 评论 -
HDU-3886-Final Kichiku “Lanlanshu”(数位DP)
Final Kichiku “Lanlanshu”Problem DescriptionDuring 2010 summer training, temperlisyer often does problem like this:“Consider a decimal integer as sequence of digits {D0, D1 … Dn-1} (D0 > 0), if ...原创 2019-12-05 19:51:21 · 273 阅读 · 0 评论 -
HDU-3562-B-number(数位DP)
B-numberProblem DescriptionA 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...原创 2019-11-30 23:34:40 · 164 阅读 · 0 评论 -
HDU-3709-Balanced Number(数位DP)
Balanced NumberProblem DescriptionA balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box with weight indi...原创 2019-11-30 20:17:35 · 115 阅读 · 0 评论 -
HDU-4734-F(x)(数位DP)
F(x)Problem DescriptionFor a decimal number x with n digits (AnAn-1An-2 … A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + … + A2 * 2 + A1 * 1. Now you are given two numbers A and B, ...原创 2019-11-28 17:43:45 · 296 阅读 · 0 评论 -
HDU-2089-不要62(水过 / 数位DP初探)
不要62Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如:62315 73418 88914都属于不吉利号码。但是,61152虽然含有6和...原创 2019-11-27 13:11:45 · 156 阅读 · 0 评论 -
POJ-2279-Mr. Young's Picture Permutations(DP)
Mr. Young’s Picture PermutationsMr. Young wishes to take a picture of his class. The students will stand in rows with each row no longer than the row behind it and the left ends of the rows aligned. ...原创 2019-11-21 21:23:29 · 122 阅读 · 0 评论 -
HDU-1203-I NEED A OFFER!(简单DP)
I NEED A OFFER!Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并...原创 2019-10-10 18:41:34 · 192 阅读 · 0 评论 -
HDU-1069-Monkey and Banana(DP+排序)
Monkey and BananaProblem DescriptionA 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 th...原创 2019-10-10 15:42:29 · 173 阅读 · 0 评论 -
HDU-1087-Super Jumping! Jumping! Jumping!(简单DP)
Super Jumping! Jumping! Jumping!Problem DescriptionNowadays, 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 th...原创 2019-10-10 12:19:57 · 117 阅读 · 0 评论 -
HDU-1231-最大连续子序列(简单DP)
最大连续子序列Problem Description给定K个整数的序列{ N1, N2, …, NK },其任意连续子序列可表示为{ Ni, Ni+1, …,Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个,例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最...原创 2019-10-09 19:52:57 · 154 阅读 · 0 评论 -
2019-CCPC-秦皇岛站-I题-Problem I. Invoker(DP)
题意:一个人有QWE三个基础技能,和一个大招R技能,每释放一个基础技能就会获得一个相应的技能点,最多同时拥有三个技能点,最早获得的技能点会被最新释放的技能点给挤走,每次释放R技能,就会根据现有的三个技能点的组合,释放出一个特殊技能,但是释放R技能不会消耗目前拥有的技能点。技能点组合对应的特殊技能名称如上图所示。现给出一列按时间顺序释放的特殊技能,问如何释放基础QWE技能以及R技能,使得释放的技...原创 2019-09-23 16:42:53 · 1812 阅读 · 5 评论 -
Codeforces-1221-D. Make The Fence Great Again (DP)
D. Make The Fence Great AgainYou have a fence consisting of n vertical boards. The width of each board is 1. The height of the i-th board is ai. You think that the fence is great if there is no pair ...原创 2019-09-20 11:26:01 · 359 阅读 · 0 评论 -
HDU-1011-Starship Troopers(树形DP(历史遗留题 ))
Starship TroopersProblem DescriptionYou, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each room is occupied by s原创 2020-08-24 16:25:44 · 293 阅读 · 0 评论 -
CodeForces 161D-Distance in Tree(树形DP / 点分治)
Distance in TreeThe distance between two vertices of a tree is the length (in edges) of the shortest path between these vertices.You are given a tree with n vertices and a positive number k. Find th...原创 2020-02-26 20:55:00 · 228 阅读 · 0 评论 -
HDU-2196-Computer(树形DP经典题)
ComputerProblem DescriptionA school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected ...原创 2020-02-07 15:06:39 · 547 阅读 · 0 评论 -
Codeforces-1354-E. Graph Coloring(二分图+DP)
E. Graph ColoringYou are given an undirected graph without self-loops or multiple edges which consists of n vertices and m edges. Also you are given three integers n1, n2 and n3.Can you label each vertex with one of three numbers 1, 2 or 3 in such way, t原创 2020-09-03 17:01:51 · 232 阅读 · 0 评论 -
HDU-3102-Lawrence of Arabia(DP)
Lawrence of ArabiaProblem DescriptionT. E. Lawrence was a controversial figure during World War I. He was a British officer who served in the Arabian theater and led a group of Arab nationals in guerilla strikes against the Ottoman Empire. His primary ta原创 2020-09-01 15:29:58 · 229 阅读 · 0 评论 -
记一道DP题
题意:给定 n l r求长度为n的 且元素在 [l-r] 的 且 数组元素和是3的倍数的 数组的 个数思路:DPdp[i][j] 表示 长度为i的 数组元素mod 3 为 j 的数组的个数那么转移方程:mod0 表示区间内的数mod 3 = 0的个数 mod1 mod2 同理dp[i][0] = ((dp[i-1][0]*mod0)%mod+(dp[i-1][1]*mod2)%mod+(dp[i-1][2]*mod1)%mod)%moddp[i][1] = ((dp[i-1][0]*mo原创 2020-08-23 15:02:07 · 122 阅读 · 0 评论 -
HDU-3001-Travelling(状压DP+三进制)
TravellingProblem DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he...原创 2020-02-08 00:08:18 · 212 阅读 · 0 评论 -
HDU-2476-String painter(区间DP+DP)
String painterProblem DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter...原创 2020-02-07 19:43:46 · 340 阅读 · 1 评论 -
POJ-1463-Strategic game(树形DP)
Strategic gameBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must d...原创 2020-02-07 16:26:46 · 198 阅读 · 0 评论 -
POJ-2378-Tree Cutting(树形DP)
Tree CuttingAfter Farmer John realized that Bessie had installed a “tree-shaped” network among his N (1 <= N <= 10,000) barns at an incredible cost, he sued Bessie to mitigate his losses.Bessi...原创 2020-02-07 15:53:33 · 257 阅读 · 0 评论