codeforces 607B 区间dp

最新推荐文章于 2021-01-28 16:26:34 发布

-Atlantis-

最新推荐文章于 2021-01-28 16:26:34 发布

阅读量609

点赞数

分类专栏： dp 文章标签： codeforces 607B dp

本文链接：https://blog.csdn.net/enamor_AC/article/details/57083445

版权

本文讨论了Zuma游戏中的策略问题，即如何在最少的时间内消除所有宝石。通过理解回文串的概念，可以确定每一步的操作。题目提供了一种基于动态规划的解决方案，用于计算达到这一目标所需的最小步数。

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

Zuma

time limit per test2 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.

In one second, Genos is able to choose exactly one continuous substring of colored gemstones that is a palindrome and remove it from the line. After the substring is removed, the remaining gemstones shift to form a solid line again. What is the minimum number of seconds needed to destroy the entire line?

Let us remind, that the string (or substring) is called palindrome, if it reads same backwards or forward. In our case this means the color of the first gemstone is equal to the color of the last one, the color of the second gemstone is equal to the color of the next to last and so on.

Inp