随笔分类 - 04.动态规划 - (1)区间DP
摘要：题目链接：http://poj.org/problem?id=1179 Time Limit: 1000MS Memory Limit: 10000K Description Polygon is a game for one player that starts on a polygon with
阅读全文
摘要：题目链接：http://poj.org/problem?id=1651 Time Limit: 1000MS Memory Limit: 65536K Description The multiplication puzzle is played with a row of cards, each
阅读全文
摘要：题目链接：http://poj.org/problem?id=3280 Time Limit: 2000MS Memory Limit: 65536K Description Keeping track of all the cows can be a tricky task so Farmer J
阅读全文
摘要：题目链接：http://poj.org/problem?id=2955 Time Limit: 1000MS Memory Limit: 65536K Description We give the following inductive definition of a “regular brack
阅读全文
摘要：用dp[i][j]表示把[i,j]的字符串str改写成回文串需要的最小操作步数。 并且假设所有dp[ii][jj] (ii>i , jj<j)都为已知，即包括dp[i+1][j]、dp[i][j-1]、dp[i+1][j-1]这三者都已知，则： 1、 如果str[i]==str[j]，那么dp[i]
阅读全文
