Minimum Ternary String CodeForces - 1009B（思维）

starlet_kiss

于 2020-02-15 19:34:39 发布

阅读量141

点赞数

文章标签：思维

本文链接：https://blog.csdn.net/starlet_kiss/article/details/104332859

版权

本文介绍了一种算法，用于通过特定的字符交换操作，将由字符'0'、'1'和'2'组成的字符串优化为字典序最小的形式。重点讨论了如何保持'1'向前移动，同时保持'0'和'2'之间的相对位置不变，以实现最优解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a ternary string (it is a string which consists only of characters ‘0’, ‘1’ and ‘2’).

You can swap any two adjacent (consecutive) characters ‘0’ and ‘1’ (i.e. replace “01” with “10” or vice versa) or any two adjacent (consecutive) characters ‘1’ and ‘2’ (i.e. replace “12” with “21” or vice versa).

For example, for string “010210” we can perform the following moves:

“010210” →→ “100210”;
“010210” →→ “001210”;
“010210” →→ “010120”;
“010210” →→ “010201”.
Note than you cannot swap “02” →→ “20” and vice versa. You cannot perform any other operations with the given string excluding described above.

You task is to obtain the minimum possible (lexicographically) string by using these swaps arbitrary number of times (possibly, zero).

String aa is lexicographically less than string bb (if strings aa and bb have the same length) if there exists some position ii (1≤i≤|a|1≤i≤|a|, where |s||s| is the length of the string ss) such that for every j<ij<i holds aj=bjaj=bj, and ai<biai<bi.

Input
The first line of the input contains the string ss consisting only of characters ‘0’, ‘1’ and ‘2’, its length is between 11 and 105105 (inclusive).

Output
Print a single string — the minimum possible (lexicographically) string you can obtain by using the swaps described above arbitrary number of times (possibly, zero).

Examples
Input
100210
Output
001120
Input
11222121
Output
11112222
Input
20
Output
20
思路：很不错的一道题目。1可以和0交换，也可以和2交换。那么1就要尽可能的往前。0和2不能交换，那么第一个2后面的那些0和2的相对位置是不会变的，因为1我们要让它尽可能的往前，这样才是最优的。因此我们将第一个2前面的0放置在最前面，后面排上所有的1，剩下的0和2相对位置就不变了。
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn=1e5+10;
typedef long long ll;
char s[maxn],str[maxn];
int main()
{
    scanf("%s",&s);
    int n = strlen(s);
    int sum = 0； // 第一个2 前边0 的个数 
    int sum1 = 0;  // 1 的个数
    int k = 0,flag = 0;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='0' && flag==0)
            sum++;
        else if(s[i]=='0' && flag==1)
            str[k++] = s[i];
        else if(s[i]=='1')
            sum1++;
        else if(s[i]=='2')
        {
            flag = 1;
            str[k++] = s[i];
        }
    }
    for(int i=0;i<sum;i++)
        printf("0");
    for(int i=0;i<sum1;i++)
        printf("1");
    printf("%s\n",str);
    return 0;
}