
区间dp
life4711
这个作者很懒,什么都没留下…
展开
-
lightoj 1033 区间dp
http://lightoj.com/volume_showproblem.php?problem=1033By definition palindrome is a string which is not changed when reversed. "MADAM" is a nice example of palindrome. It is an easy job to test wh原创 2014-05-25 21:35:32 · 970 阅读 · 0 评论 -
CF149D 区间dp
http://codeforces.com/problemset/problem/149/DD. Coloring Bracketstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard原创 2015-06-08 17:05:43 · 1313 阅读 · 0 评论 -
hdu4745 最长回文子序列(区间DP)
http://acm.hdu.edu.cn/showproblem.php?pid=4745Problem DescriptionLong long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to play a game with so原创 2015-04-15 14:59:51 · 984 阅读 · 0 评论 -
poj1179 区间dp(记忆化搜索写法)有巨坑!
http://poj.org/problem?id=1179DescriptionPolygon is a game for one player that starts on a polygon with N vertices, like the one in Figure 1, where N=4. Each vertex is labelled with an integer原创 2015-03-18 11:38:55 · 1604 阅读 · 0 评论 -
hdu4283 区间dp
http://acm.hdu.edu.cn/showproblem.php?pid=4283Problem Description The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJU原创 2015-03-27 10:34:13 · 1227 阅读 · 0 评论 -
区间dp
http://acm.hdu.edu.cn/showproblem.php?pid=4632Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without chang原创 2014-05-27 19:31:02 · 778 阅读 · 0 评论 -
poj 2955 区间dp
http://poj.org/problem?id=2955DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence,if s is a regular b原创 2014-05-22 11:27:16 · 726 阅读 · 0 评论 -
hdu 4293 区间dp
http://acm.hdu.edu.cn/showproblem.php?pid=4293Problem Description After the regional contest, all the ACMers are walking alone a very long avenue to the dining hall in groups. Groups can va原创 2014-05-26 11:40:36 · 713 阅读 · 0 评论 -
poj 1651 区间dp+矩阵连乘DP
http://poj.org/problem?id=1651DescriptionThe 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 ro原创 2014-05-23 09:57:24 · 803 阅读 · 0 评论 -
light oj 1031 区间dp+博弈
http://lightoj.com/volume_showproblem.php?problem=1031You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take them alternatively.原创 2014-05-28 17:01:35 · 824 阅读 · 0 评论 -
poj1141 区间dp
http://poj.org/problem?id=1141DescriptionLet us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence. 2. If S is a regular sequence, then (S)原创 2014-10-29 16:19:25 · 656 阅读 · 0 评论 -
Zoj 3537 Cake (区间DP_最优三角形剖分)
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3537题目大意:给定n个点的坐标,先问这些点是否能组成一个凸包,如果是凸包,问用不相交的线来切这个凸包使得凸包只由三角形组成,根据costi, j = |xi + xj| * |yi + yj| % p算切线的费用,问最少的切割费用。转载 2014-05-21 15:50:25 · 787 阅读 · 0 评论 -
Lightoj 1422 区间dp
http://lightoj.com/volume_showproblem.php?problem=1422原创 2014-05-21 19:11:47 · 594 阅读 · 0 评论 -
zoj 3469 区间dp
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3469When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this tim原创 2014-05-23 21:35:22 · 722 阅读 · 0 评论 -
sdut 1309 不老的传说 区间dp(较难)
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1309题目描述一位先知告诉dynamic,在遥远的地方,有一处不老的泉水,在那里,他可以找到他人生的意义。按照先知的指引,dynamic出发了。翻越雪山,穿过丛林,渡过汪洋,终于来到了沙漠的最深处。按照先知的说法,泉水就在这个地方。然而原创 2014-05-24 18:18:12 · 895 阅读 · 0 评论 -
poj 1738 取石子游戏 区间dpgarsiawachs算法
http://poj.org/problem?id=1738DescriptionThere is an old stone game.At the beginning of the game the player picks n(1At each step of the game,the player can merge two adjoining piles to a ne原创 2014-05-25 20:24:46 · 813 阅读 · 0 评论 -
hdu 5396 区间dp+组合
http://acm.hdu.edu.cn/showproblem.php?pid=5396Problem DescriptionTeacher Mai has n numbers a1,a2,⋯,anand n−1 operators("+", "-" or "*")op1,op2,⋯,opn−1, which are arranged in the form a1原创 2015-08-19 15:00:37 · 932 阅读 · 0 评论