——动态规划——
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
CodeForces - 981E Addition on Segments(线段树+bitset优化01背包)
E. Addition on Segmentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGrisha come to a contest and faced the following problem....原创 2018-10-07 21:51:33 · 316 阅读 · 0 评论 -
LightOJ - 1205 Palindromic Numbers(回文数个数,数位DP)
A palindromic number or numeral palindrome is a 'symmetrical' number like 16461 that remains the same when its digits are reversed. In this problem you will be given two integers i j, you have to find原创 2017-10-11 22:57:42 · 641 阅读 · 0 评论 -
LightOJ - 1140 How Many Zeroes?(数位DP,有前导0)
Jimmy writes down the decimal representations of all natural numbers between and including m and n, (m ≤ n). How many zeroes will he write down?InputInput starts with an integer T (≤ 11000),原创 2017-10-11 18:50:04 · 355 阅读 · 0 评论 -
HDU - 3652 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 26原创 2017-10-11 18:42:53 · 230 阅读 · 0 评论 -
HDU - 2089 不要62(数位DP入门)
不要62Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如:62315 73418 88914都属于不吉利号码。原创 2017-10-10 20:30:50 · 255 阅读 · 0 评论 -
POJ - 1947 Rebuilding Roads(树上背包)
Rebuilding RoadsDescriptionThe cows have reconstructed Farmer John's farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn't have time t原创 2017-10-10 15:23:10 · 299 阅读 · 0 评论 -
POJ - 1192 最优连通子集 (树形DP)
最优连通子集Description众所周知,我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示,如果x, y都是整数,我们就把点P称为整点,否则点P称为非整点。我们把平面上所有整点构成的集合记为W。 定义1 两个整点P1(x1, y1), P2(x2, y2),若|x1-x2| + |y1-y2| = 1,则称P1, P2相邻,记作P1~P原创 2017-10-10 13:56:22 · 353 阅读 · 0 评论 -
GYM - 101201B Buggy Robot(BFS+DP)
You are trying to program a robot to navigate through a 2-dimensional maze and find the exit.The maze can be represented as a grid with n rows and m columns. Some grid cells have obstaclesthat the rob原创 2017-10-02 21:49:26 · 880 阅读 · 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 co原创 2017-10-09 21:41:09 · 323 阅读 · 3 评论 -
POJ - 1463 Strategic game(树形DP)
Strategic gameDescriptionBob 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 follow原创 2017-10-09 19:13:54 · 329 阅读 · 0 评论 -
POJ - 2288 Islands and Bridges(状压DP,详细解释)
Islands and BridgesDescriptionGiven a map of islands and bridges that connect these islands, a Hamilton path, as we all know, is a path along the bridges such that it visits each island ex原创 2017-09-11 17:43:01 · 555 阅读 · 0 评论 -
POJ - 2411 Mondriaan's Dream(状压DP,详细解释)
Mondriaan's DreamDescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use h原创 2017-09-15 19:06:34 · 479 阅读 · 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原创 2017-10-12 13:50:14 · 458 阅读 · 0 评论 -
CodeForces - 55D (完美数)
Beautiful numbersVolodya 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 digit原创 2017-10-11 19:58:57 · 1151 阅读 · 0 评论 -
GYM - 100812I Dragon Delivers (DP)
Dragon Deliverstime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputI stood just in front of an enormous castle of black s原创 2017-12-02 00:22:03 · 258 阅读 · 0 评论 -
Gym - 101889F Fundraising (二维带权最长上升子序列)
题意:二维带权最长上升子序列。解题思路:先对一维排序,然后在第二维做最长上升子序列的NlogN做法,同时维护好权值即可。记得离散化。这里相同的点最好合并一下,方便处理。 #include<bits/stdc++.h>using namespace std;const int MAXN=200005;typedef long long ll;stru...原创 2018-10-13 21:36:12 · 649 阅读 · 0 评论 -
牛客国庆集训派对Day3 B-Tree (树上包含某个节点的连通子集个数)
链接:https://www.nowcoder.com/acm/contest/203/B来源:牛客网 题目描述修修去年种下了一棵树,现在它已经有n个结点了。修修非常擅长数数,他很快就数出了包含每个点的连通点集的数量。澜澜也想知道答案,但他不会数数,于是他把问题交给了你。输入描述:第一行一个整数n (1≤ n ≤ 106),接下来n-1行每行两个整数ai,bi表示一条边 ...原创 2018-10-03 18:37:21 · 569 阅读 · 0 评论 -
计蒜客 Transport Ship(ACM-ICPC 2018 焦作赛区网络预赛 K)(多重背包装满的方案数)
There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[i]V[i] and the number of the i^{th}ith kind of ship is 2^{C[i]} - 12C[i]−1. How many d...原创 2018-09-15 19:13:53 · 432 阅读 · 0 评论 -
计蒜客 Mathematical Curse(ACM-ICPC 2018 焦作赛区网络预赛 B)(DP)
A prince of the Science Continent was imprisoned in a castle because of his contempt for mathematics when he was young, and was entangled in some mathematical curses. He studied hard until he reached ...原创 2018-09-15 19:08:47 · 305 阅读 · 0 评论 -
计蒜客 AC Challenge (2018 ICPC亚洲区域赛网络赛 南京 E)(状压DP)
题目链接:https://nanti.jisuanke.com/t/30994 Dlsj is competing in a contest with n (0 < n \le 20)n(0<n≤20) problems. And he knows the answer of all of these problems.However, he can submit ii-t...原创 2018-09-01 20:53:59 · 1016 阅读 · 0 评论 -
2018年上海金马五校程序设计竞赛 Problem B : Ball Game
Problem B : Ball GameFrom: DHUOJ, 2018060902Submit (Out of Contest)Time Limit: 3 sDescriptionThere are 4 types of balls (A, B, C and D) and a huge box. The balls of the same type have the same weight....原创 2018-06-09 17:25:09 · 794 阅读 · 1 评论 -
HDU - 5418 Victor and World(最短哈密顿回路)
Victor and WorldTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 1777 Accepted Submission(s): 837Problem DescriptionAfter trying hard for ma...原创 2018-04-24 17:47:17 · 1024 阅读 · 0 评论 -
CodeForces - 946D Timetable(分组背包)
Timetabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIvan is a student at Berland State University (BSU). There are n days in Berland week, an...原创 2018-03-28 15:41:32 · 302 阅读 · 0 评论 -
“景驰科技杯”2018年华南理工大学程序设计竞赛 G Youhane as "Bang Riot" (斜率优化DP)
链接:https://www.nowcoder.com/acm/contest/94/G来源:牛客网题目描述 Blastix Riotz歌います ガンバロウ!!ヴィヴィヴィオケー!(ドゥルル)ファファ!シマムラ!シミケン!エエェェ↓↓ エエェェェェ↓↓↓ウェェ↓キュウウゥッ↑サクセスデュゥゥ...あああああああああああああああああああああああああああああああああ (亲爱的,你筐体塌...原创 2018-04-08 20:49:09 · 309 阅读 · 0 评论 -
CodeForces - 919D Substring (DP 记忆化搜索)
Substringtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a graph with n nodes and m directed原创 2018-02-01 00:29:28 · 287 阅读 · 0 评论 -
CodeForces - 918D MADMAX (DP 记忆化搜索)
MADMAXtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs we all know, Max is the best video game player amo原创 2018-01-31 17:28:28 · 338 阅读 · 0 评论 -
SGU - 131 Hardwood floor (状压DP)
131. Hardwood floor time limit per test: 0.25 sec. memory limit per test: 4096 KB The banquet hall of Computer Scientists' Palace has a rectangular form of the size M x N (11) rectangles (原创 2017-09-20 11:28:26 · 516 阅读 · 0 评论 -
HDU - 2280 Tetris Comes Back (状压DP)
Tetris Comes BackProblem DescriptionWorking in corporation is toilsome and rest is important. In leisure time, WisKey like to play Tetris. The Tetris game in board is N*5, and there are 8 ki原创 2017-09-20 21:05:13 · 629 阅读 · 0 评论 -
HDU - 2881 Jack's struggle (最长上升子序列变形)
Jack's struggleProblem DescriptionA team of airborne troops are ready to complete some missions.The battlefield was divided into a grid of n*n, this team can be air-dropped at any place on原创 2017-08-09 17:15:57 · 734 阅读 · 0 评论 -
HDU - 1003 Max Sum(最大连续子段和)
DP入门题。但觉得这道题更像是贪心,贪心的选取和最大的部分,稍微思考就可以写出来了,不过用到了DP的思想。原创 2017-08-09 19:51:11 · 327 阅读 · 0 评论 -
HDU - 1024 Max Sum Plus Plus(最大M段连续子段和,详细解释)
解题思路:膜拜前人,他们到底是怎么想到的,看了各种博客,最后加上自己的理解,终于搞懂了。希望以后自己也能独立思考出来。原创 2017-08-09 21:37:10 · 396 阅读 · 0 评论 -
HDU - 1081 To The Max ( 最大子矩阵)
解题思路:因为是连续的,所以一切都很简单,稍微思考就可以转化为最大连续子段和的问题了。我们枚举由行组成的连续矩阵,然后对每个矩阵的每一列求和,然后求最大连续子段和就可以了。原创 2017-08-09 22:17:33 · 244 阅读 · 0 评论 -
POJ - 1276 Cash Machine(三种背包模板)
多重背包裸题,套模板即可,由于多重背包用到了01背包和完全背包,所以这里直接结合三种背包写成一个模板。代码有详细注释。多重背包的解法是用了二进制的思想,把N个物品分解成logN件,他们可以组合出各种各样的物品。详见代码。原创 2017-08-18 13:06:15 · 247 阅读 · 0 评论 -
HDU - 1114 Piggy-Bank (完全背包)
《背包九讲2.0》是个好东西,把里面的东西用上直接过,如果是必须填满,求最小时那么初始化为INF原创 2017-08-16 21:35:42 · 244 阅读 · 0 评论 -
HDU - 1114 Piggy-Bank(01背包变形)
样例很误导人,其实能逃跑的概率并不是简单的相加!如果是这样就会把能抢的钱当做价值,概率当做容量,然后就是个01背包问题。但这样是错的,被抓的概率并不能简单的相加。应该是求能逃跑的概率要大于题目给的(1-被抓的概率),由于是浮点数,概率当做容原创 2017-08-16 20:59:04 · 237 阅读 · 0 评论 -
POJ - 1293 Duty Free Shop(01背包记录物品)
一开始不知道L是拿来干嘛的,后来才发现用于判断能不能全部装满的。一开始先贪心的用M装满尽可能大的空间,这里转化为01背包问题,然后再把剩下的盒子用L装,看看能不能装满。这里主要的难题原创 2017-08-16 20:13:50 · 558 阅读 · 0 评论 -
HDU - 1203 I NEED A OFFER! (01背包变形)
很简单的一道背包DP变形,概率论要学好呀!不然会想复杂。至少一份offer的概率其实就是1减去一份都收不到的概率。这样子就是背包dp模型了。动归方程用的是收不到的概率原创 2017-08-16 17:13:07 · 249 阅读 · 0 评论 -
POJ - 1390 Blocks(记忆化搜索)
好题!一开始想着区间DP,两个维度怎么搞都搞不出来,后来看了题解,发现只要加一个维度,问题就迎刃而解了。但是这道题还是离不开搜索,之前做过一道这道题的二维形式,当时那道题数据水,直接爆搜就过了,这道题爆搜肯定超时,因此要用记忆化搜索,具体就是定义一个三维数组dp[i][j][rlen],代表消去i~j和右边与j相邻且颜色相同的长度为rlen的区间的最原创 2017-08-16 15:38:51 · 633 阅读 · 0 评论 -
POJ - 3404 Bridge over a rough river (DP)
很有意思的一道题目,不知道是用了贪心的思想还是动态规划。我认为一开始是贪心的思考,然后找到最佳决策,然后再用dp的思想去实现,前面的i个人的最少时间,对后面肯定没有影响。首先对时间进行排序,一开始肯定是想让走得最快的人跟过去,这样回来的时候原创 2017-08-16 13:59:45 · 322 阅读 · 0 评论 -
POJ - 1692 Crossed Matchings(DP)
解题思路:慢慢练,相信以后也可以自己想到递推式!!用dp[i][j]代表第一行第1~i个和第二行第1~j个之间的最多连接数。先不考虑将a[i],b[j]连线的情况,肯定有dp[i][j]=max(dp[i][j-1],max(dp[i-1][j],dp[i-1][j-1]));然后再考虑连线的情况。如果a[i]==a[j],那么将a[i]和b[j]连线是毫无意义的,因为不可能产生相交,所以要考虑不相等的情况,这个时候应该怎么办呢。这里用到了贪心的思想,将第二行与a[i]最近相等的相连,和第一行与b[j]最近原创 2017-08-09 16:14:10 · 277 阅读 · 0 评论