随笔分类 - 动态规划--区间DP
摘要:UVA - 10559 Blocks 题意:消消乐,每次连续相同的可以消除,分数加上长度的平方,问最多可以获得几分全部消完 题解: 区间dp + 记忆化搜索 dp[i][j][k] : (区间 [i, j] 后面带上一段和 j 颜色相同的且长度为 k )的消消乐最大积分 1.消最后一段颜色和 j 颜
阅读全文
摘要:点击传送 Alice’s Stamps Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1448 Accepted Submission(s):
阅读全文
摘要:Multiplication Puzzle ZOJ - 1602 传送门 The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the mo
阅读全文
摘要:Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3815 Accepted Submission(s): 2266 Pro
阅读全文
摘要:Time limit1000 ms Memory limit65536 kB The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the
阅读全文

浙公网安备 33010602011771号