题目链接:https://www.nowcoder.com/acm/contest/84/A
给定字符串s,s只包含小写字母,请求出字典序最大的子序列。
子序列:https://en.wikipedia.org/wiki/Subsequence
字典序:https://en.wikipedia.org/wiki/Lexicographical_order
子序列:https://en.wikipedia.org/wiki/Subsequence
字典序:https://en.wikipedia.org/wiki/Lexicographical_order
输入描述:
一行一个字符串s (1 <= |s| <= 100,000)。
输出描述:
字典序最大的子序列。
示例1
输入
ababba
输出
bbba示例2
输入
abbcbccacbbcbaaba
输出
cccccbba
分析:对不同的字符挂一个链表,记录对应的下标。扫描时,每次都是先查找最大的字符(下标: max_index),然后输出对应链表的下标(确保不小于max_index)
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void Solve() {
vector<int> vi[26];
string s;
cin >> s;
int max_index = 0;
for (int i = 0; s[i]; i++) {
vi[s[i] - 'a'].push_back(i);
if (s[i] > s[max_index]) max_index = i;
}
int index = max_index;
while (s[index]) {
if (s[index] == s[max_index]) {
int size = vi[s[max_index] - 'a'].size();
for (int i = 0; i < size; i++) {
//只能输出不小于当前下标的字符
if (vi[s[max_index] - 'a'][i] >= max_index) cout << s[max_index];
}
//更新max_index
index = vi[s[max_index] - 'a'].back() + 1;
max_index = index;
for (int i = index; s[i]; i++) {
if (s[i] > s[max_index]) max_index = i;
}
continue;
}
index++;
}
cout << '\n';
}
int main() {
Solve();
return 0;
}
//ababba
//abbcbccacbbcbaaba
//eeeeeeeeeeeeee
//eeabeebd