[CodeForces - 197C] C - Lexicographically Maximum Subsequence

最新推荐文章于 2021-12-22 15:37:55 发布

a8233821

最新推荐文章于 2021-12-22 15:37:55 发布

阅读量169

点赞数

原文链接：http://www.cnblogs.com/whc200305/p/7214382.html

版权

C - Lexicographically Maximum Subsequence

You've got string s, consisting of only lowercase English letters. Find its lexicographically maximum subsequence.

We'll call a non-empty string s[p₁p₂... p_k] = s_p₁s_p₂... s_{p_k}(1 ≤ p₁ < p₂ < ... < p_k ≤ |s|) a subsequence of string s = s₁s₂... s_|s|.

String x = x₁x₂... x_|x| is lexicographically larger than string y = y₁y₂... y_|y|, if either |x| > |y| and x₁ = y₁, x₂ = y₂, ... , x_|y| = y_|y|, or exists such number r (r < |x|, r < |y|), that x₁ = y₁, x₂ = y₂, ... , x_r = y_r and x_r + 1 > y_r + 1. Characters in lines are compared like their ASCII codes.

Input

The single line contains a non-empty string s, consisting only of lowercase English letters. The string's length doesn't exceed 10⁵.

Output

Print the lexicographically maximum subsequence of string s.

Example

Input

ababba

Output

bbba

Input

abbcbccacbbcbaaba

Output

cccccbba

Note

Let's look at samples and see what the sought subsequences look like (they are marked with uppercase bold letters).

The first sample: aBaBBA

The second sample: abbCbCCaCbbCBaaBA

这个题目就是要求出子串中字典序最大的.

由于本题有许多方法,那我就讲一讲我自己的好了.

由于我们要尽量挑字典序最大的字符作为开头(首关键字并不是长度!),所以,我们要记录当前字符串的最大字符,然后,如果剩下的字符里面,已经不存在这个最大的字符,那么这个字符就下调,知道存在.

这样一个纯模拟的过程就好了,不过不知道为什么我在比赛中时间用的稍微有点多......

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 int len,las[105],nxt[100005],R[105];
 6 char a[100005],c;
 7 int read(){
 8     int x=0,f=1; char ch=getchar();
 9     while (ch<'0'||ch>'9'){if (ch=='-') f=-f; ch=getchar();}
10     while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
11     return x*f;
12 }
13 int main(){
14     scanf("%s",a),len=strlen(a),c='a';
15     memset(las,255,sizeof las);
16     memset(nxt,0,sizeof nxt);
17     for (int i=len-1; i>=0; i--) if (las[a[i]-'a']==-1) las[a[i]-'a']=i,nxt[i]=i,R[a[i]-'a']=i;
18     else nxt[i]=las[a[i]-'a'],las[a[i]-'a']=i;
19     for (int i=0; i<len; i++) if (c<a[i]) c=a[i];
20     for (int i=0; i<len; i++) if (a[i]==c){
21         putchar(c); if (nxt[i]!=i) continue;
22         while (c>'a'&&R[c-'a']<=i) c=(char)((int)c-1);
23     }
24     return 0;
25 }