UVa 10559 Blocks（DP）

最新推荐文章于 2021-09-07 16:44:39 发布

wujy47

最新推荐文章于 2021-09-07 16:44:39 发布

阅读量1.6k

点赞数 1

分类专栏： ACM 动态规划文章标签：动态规划 DP acm-icpc

本文链接：https://blog.csdn.net/wujysh/article/details/41076409

版权

该博客详细介绍了UVa 10559 'Blocks'游戏的规则，其中玩家每次点击一个方块会消除包含该方块的连续同色方块段，并获得分数。文章探讨了如何通过动态规划找到消除方块的最优策略，以求得最高可能的得分。问题的关键在于设计动态规划的状态转移方程，考虑当前决策对未来决策的影响，并提供了一个优化方案来简化计算。最后，给出了解题思路和参考代码。

摘要由CSDN通过智能技术生成

Problem A

Blocks

Input: Standard Input

Output: Standard Output

Time Limit: 10 Seconds

Some of you may have played a game called 'Blocks'. There are n blocks in a row, each box has a color. Here is an example: Gold, Silver, Silver, Silver, Silver, Bronze, Bronze, Bronze, Gold.

The corresponding picture will be as shown below:

Figure 1

If some adjacent boxes are all of the same color, and both the box to its left(if it exists) and its right(if it exists) are of some other color, we call it a 'box segment'. There are 4 box segments. That is: gold, silver, bronze, gold. There are 1, 4, 3, 1 box(es) in the segments respectively.

Every time, you can click a box, then the whole segment containing that box DISAPPEARS. If that segment is composed of k boxes, you will get k*k</