Linear Dynamic Programming
文章平均质量分 78
Chlerry
We're all just prisoners here, of our own device.
展开
-
[UVa 11584]Partitioning by Palindromes
We say a sequence of char- acters is a palindrome if it is the same written forwards and backwards. For example, ‘racecar’ is a palindrome, but ‘fastcar’ is not.原创 2015-08-18 16:27:07 · 405 阅读 · 0 评论 -
[UVa10003]Cutting Sticks
[UVa10003]Cutting Sticks原创 2015-08-18 23:19:53 · 247 阅读 · 0 评论 -
[Codeforces Round #318 ]Bear and Blocks
Limak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of hi identical blocks.原创 2015-09-09 19:51:11 · 282 阅读 · 0 评论 -
[UVa 1626]Brackets sequence
[UVa 1626]Brackets sequence原创 2015-08-19 13:02:19 · 411 阅读 · 0 评论 -
[UVa 1625]Color Length
Problem DescriptionMy Problem Report这是道非常值得总结的题。通过这道题我对两个概念的理解加深了很多: 无后效性原则 最优子结构 在做动态规划的时候,我们需要明白一点,就是当前状态一定是由过去的状态(也就是最优子结构)转移而来的,而不是说过去的状态影响了现在的状态。我们在对状态进行转移时,要充分意识到三点: 过去的状态一定是最优的,我们原创 2015-09-09 20:40:37 · 391 阅读 · 0 评论 -
[UVa 1625]Color Length
[UVa 1625]Color Length原创 2015-08-18 20:55:01 · 177 阅读 · 0 评论