Codeforces 955B - Not simply beatiful strings(模拟）

最新推荐文章于 2020-03-27 13:04:47 发布

原创

最新推荐文章于 2020-03-27 13:04:47 发布 · 378 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#模拟 #解题报告

博客介绍了如何解决Codeforces 955B问题，涉及字符串的可爱性定义，即能否将字符串分成两个不同字母的连续组。提供了题意解析、输入输出说明、示例及解题思路，包括对字符串中字母种类数的分析，以确定是否满足题目条件。

Problem Description

Let's call a string adorable if its letters can be realigned in such a way that they form two consequent groups of equal symbols (note that different groups must contain different symbols). For example, ababa is adorable (you can transform it to aaabb, where the first three letters form a group of a-s and others — a group of b-s), but cccc is not since in each possible consequent partition letters in these two groups coincide.

You're given a string s. Check whether it can be split into two non-empty subsequences such that the strings formed by these subsequences are adorable. Here a subsequence is an arbitrary set of indexes of the string.