DP
Luowaterbi
Lazy, Stupid Trash
展开
-
POJ2411 Mondriaan‘s Dream 状压DP
题意:一个n∗mn*mn∗m的棋盘放满1∗21*21∗2的小矩形,一共有多少种方案。题解:状压DP入门。在每一行的矩形只有3种情况:横着的1∗21*21∗2矩形竖着的1∗21*21∗2矩形,本行是上方竖着的1∗21*21∗2矩形,本行是下方简单分析可得,用一个mmm位的二进制数表示本行矩形的放置。其中这位为000代表着与下一行无关(1,3),111代表着与下一行有关(2)。F[i][j]F[i][j]F[i][j]表示第iii行放置情形为jjj时的方案数。对于F[i−1][k原创 2020-12-08 23:14:05 · 158 阅读 · 0 评论 -
Codeforce24D Broken robot DP套高斯消元解决DP后效性问题
题意:在一个n∗mn*mn∗m的方格上,一个人位于坐标(x,y)(x,y)(x,y)上。在每一个格子等概率的、随机的停在原地,向左移动,向右移动,向下移动。问机器人到最后一行的期望步数多少。题解:期望dp。令dp[i][j]dp[i][j]dp[i][j]作为(i,j)(i,j)(i,j)到最后一行的期望步数。期望dp,一般状态的表示都是从后往前,不用dp[i][j]dp[i][j]dp[i][j]作为(x,y)(x,y)(x,y)到(i,j)(i,j)(i,j)的期望步数:终点的状态便于表示对原创 2020-12-07 21:53:36 · 180 阅读 · 0 评论 -
HDU 1024 Max Sum Plus Plus
题意:长度为n的数列,选择m个不想交的区间,所有区间数字和最大。题解:题目上没说m的范围,我还想着这怎么写,后来发现AC代码都是O(nm)的首先想一个最简单的DP,dp[i][j]dp[i][j]dp[i][j]代表是前jjj个数字分成iii个区间的最大区间和。那么状态转移方程为第j个数不是新的区间。dp[i][j]=dp[i][j−1]+a[j]dp[i][j]=dp[i][j-1]+a[j]dp[i][j]=dp[i][j−1]+a[j]第j个数是新的区间。dp[i][j]=maxi<原创 2020-11-25 20:23:47 · 141 阅读 · 0 评论 -
LCIS
题意:求两个序列的LCIS,最长公共上升子序列。题解:结合一下LCS和LIS即可。f[i][j]f[i][j]f[i][j]表示a[1⋯i]a[1\cdots i]a[1⋯i]与b[1⋯j]b[1\cdots j]b[1⋯j]构成的LCIS长度。当a[i]==b[j]a[i]==b[j]a[i]==b[j]时,f[i][j]=max0≤k<j,b[j]<a[i]f[i−1][k]+1f[i][j]=\max_{0\leq k<j,b[j]<a[i]}f[i-1][k]+1原创 2020-10-14 23:07:10 · 116 阅读 · 0 评论 -
POJ - 2279 Mr. Young‘s Picture Permutations
题意:输入每一排的人数,保证前一排的人数大于后一排,要求每一排从左到右编号递增,每一列从前往后编号递增,输出方案数。最多5排,最多30个编号。题解:显然可以使用动态规划。用f[i1][i2][i3][i4][i5]f[i_1][i_2][i_3][i_4][i_5]f[i1][i2][i3][i4][i5]表示第1排有i1i_1i1个人,第2排有i2i_2i2个人,第3排有i3i_3i3个人,第4排有i4i_4i4个人,第5排有i5i_5i5个人时的方案数。如果没有那么多排,直接当原创 2020-10-14 22:46:19 · 177 阅读 · 0 评论 -
HDU 6558 The Moon
题意:进行一局游戏,你有 p 的概率获胜。有一个概率 q 初始为 2% ,如果你获胜,你将有 q 的概率获得奖励;如果你没得到奖励, q 会变化, q=min(100%,q+2%);如果你输了, q 也会变化, q=min(100%,q+1.5%)。问获得奖励的期望局数为多少。分析:很明显的期望dp。对于普通的期望dp,一般是把结局的概率作为1,从开始进行记忆化递归。但是对于本题。开始时没有得到奖励,就是0,得到奖励就是1,只有 0->1 ,显然不行。既然是dp,那就要有多条转移路径的状态,原创 2020-05-24 23:50:23 · 257 阅读 · 0 评论 -
AcWing217 洛谷P4316 绿豆蛙的归宿
逆向思维,反向建图,拓扑排序。#include <iostream>#include <queue>#include <vector>using namespace std;const int N=1e5+10;struct node{int v,w;};vector<node>tr[N];queue<int>q;...原创 2020-02-08 23:46:23 · 162 阅读 · 0 评论 -
POJ3107Godfather
题目链接GodfatherTime Limit:2000MS Memory Limit:65536K Total Submissions:11238 Accepted:3946 DescriptionLast years Chicago was full of gangster fights and strange murders. Th...原创 2019-10-16 19:27:13 · 183 阅读 · 0 评论 -
POJ3140 Contestants Division
题目链接Contestants DivisionTime Limit:2000MS Memory Limit:65536K Total Submissions:12935 Accepted:3569 DescriptionIn the new ACM-ICPC Regional Contest, a special monitoring ...原创 2019-10-16 19:59:04 · 119 阅读 · 0 评论 -
HDU3586 Information Disturbing 树形dp+二分
题目链接Information DisturbingTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 5602Accepted Submission(s): 1811Problem DescriptionIn ...原创 2019-10-19 16:42:15 · 145 阅读 · 0 评论 -
POJ 2378 Tree Cutting
题目链接Tree CuttingTime Limit:1000MS Memory Limit:65536K Total Submissions:5866 Accepted:3558 DescriptionAfter Farmer John realized that Bessie had installed a "tree-shaped"...原创 2019-10-16 17:55:38 · 139 阅读 · 0 评论 -
POJ 3585 Accumulation Degree 树形dp
题目链接Accumulation DegreeTime Limit:5000MS Memory Limit:65536K Total Submissions:5388 Accepted:1309 DescriptionTrees are an important component of the natural landscape bec...原创 2019-10-16 17:22:44 · 163 阅读 · 0 评论 -
HDU 2196 Computer 树形dp
题目链接ComputerTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 38500Accepted Submission(s): 6998Problem DescriptionA school bought t...原创 2019-10-15 20:59:19 · 137 阅读 · 0 评论 -
HDU1520 Anniversary party 树形dp
题目链接Anniversary partyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23856Accepted Submission(s): 8418Problem DescriptionThere is...原创 2019-10-15 19:37:17 · 126 阅读 · 0 评论 -
HDU1561 The more, The Better 树形dp
题目链接The more, The BetterTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11018Accepted Submission(s): 6408Problem DescriptionACboy...原创 2019-10-15 19:06:00 · 147 阅读 · 0 评论