（CodeForces - 600C）Make Palindrome

最新推荐文章于 2018-10-16 11:10:13 发布

Hold_My_Own

最新推荐文章于 2018-10-16 11:10:13 发布

阅读量295

点赞数

分类专栏：贪心模拟文章标签： codeforces

本文链接：https://blog.csdn.net/wozaipermanent/article/details/77985600

版权

该博客介绍了CodeForces的一道编程题，要求通过最小次数改变字符串中的字符来构造回文串。内容涉及如何确定字符更改策略，确保构造的回文串字典序最小。举例说明了输入输出格式，并提供了问题的解决思路，包括考虑字符个数为偶数和奇数的情况，以及使用贪心策略和模拟来解决问题。

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

（CodeForces - 600C）Make Palindrome

time limit per test:2 seconds

memory limit per test:256 megabytes

input:standard input

output:standard output

A string is called palindrome if it reads the same from left to right and from right to left. For example “kazak”, “oo”, “r” and “mikhailrubinchikkihcniburliahkim” are palindroms, but strings “abb” and “ij” are not.

You are given string s consisting of lowercase Latin letters. At once you can choose any position in the string and change letter in that position to any other lowercase letter. So after each changing the length of the string doesn’t change. At first you can change some letters in s. Then you can permute the order of letters as you want. Permutation doesn’t count as changes.

You should obtain palindrome with the minimal number of changes. If there are several ways to do that you should get the lexicographically (alphabetically) smallest palindrome. So firstly you should minimize the number of changes and then minimize the palindrome lexicographically.