DP
文章平均质量分 68
元素不会背元素周期表
U don't have to say I love U to say I love you.
展开
-
Greatest Common Increasing Subsequence poj-1423
This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.InputEach sequence is described with M - its length (1 Outputoutput print L - the length of原创 2017-09-22 20:46:31 · 180 阅读 · 0 评论 -
CF-Codeforces Round #483 (Div. 2) D. XOR-pyramid 区间DP
For an array b of length m we define the function f as f(b)={b[1]if m=1f(b[1]⊕b[2],b[2]⊕b[3],…,b[m−1]⊕b[m])otherwise, where ⊕ is bitwise exclusive OR.For example, f(1,2,4,8)=f(1⊕2,2⊕4,4⊕8)=f(3,6,12)=...原创 2018-05-17 10:08:16 · 195 阅读 · 0 评论 -
poj 2955
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]...原创 2018-04-06 16:52:13 · 163 阅读 · 0 评论 -
poj 3181 Dollar Dayz
Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer Joh...原创 2018-04-06 15:46:24 · 204 阅读 · 0 评论 -
HDU 3280 Cheapest Palindrome
Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the...原创 2018-04-06 09:18:11 · 146 阅读 · 0 评论 -
HRBUST - 1186 青蛙过河
在河上有一座独木桥,一只青蛙想沿着独木桥从河的一侧跳到另一侧。在桥上有一些石子,青蛙很讨厌踩在这些石子上。由于桥的长度和青蛙一次跳过的距离都是正整数,我们可以把独木桥上青蛙可能到达的点看成数轴上的一串整点:0,1,……,L(其中L是桥的长度)。坐标为0的点表示桥的起点,坐标为L的点表示桥的终点。青蛙从桥的起点开始,不停的向终点方向跳跃。一次跳跃的距离是s到t之间的任意正整数(包括s,t)。当青蛙跳...原创 2018-03-29 08:44:28 · 285 阅读 · 0 评论 -
Lecture Sleep CodeForces - 961B
Your friend Mishka and you attend a calculus lecture. Lecture lasts n minutes. Lecturer tells ai theorems during the i-th minute.Mishka is really interested in calculus, though it is so hard to stay a...原创 2018-04-07 19:19:06 · 301 阅读 · 0 评论 -
机器人走方格 51Nod - 1118
M * N的方格,一个机器人从左上走到右下,只能向右或向下走。有多少种不同的走法?由于方法数量可能很大,只需要输出Mod 10^9 + 7的结果。Input第1行,2个数M,N,中间用空格隔开。(2 Output输出走法的数量。Sample Input2 3Sample Output3由图可以看出第一行和第一列每个点的走法都只有一原创 2017-12-12 20:46:51 · 184 阅读 · 0 评论 -
区间DP结构
for(int l=1; l<n; l++) //l是区间长度{ for(int i=1; i+l<=n; i++) //i是区间的起点 { int j=l+i; //区间终点 for(int k=i; k<j; k++) //用这个状态转移去退出区间[i,j]的值 f[i,j]=max(f[i,k]+f[k+1,j]...原创 2018-05-17 10:14:50 · 143 阅读 · 0 评论