题意:给你一个长度为n的全由小写字母组成的字符串,要求你保持原序列顺序的前提下去重得到字典序最大的子序列。
思路:
思路其实很清晰,就是在能让大的字符靠前且自身还能在后面出现的情况下先输出较大的字符。
赛中代码基本框架没啥问题,但是万万忘了单调栈这个好东西呀!呜呜呜嗝~
后面才知道这是个牛客原题,嗐,太垃圾了,人菜还不喜欢刷题,代码如下,具体思路见原题代码注释。
C++代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9+7;
const int N = 2e5 + 5;
inline void read(int &x){
char t=getchar();
while(!isdigit(t)) t=getchar();
for(x=t^48,t=getchar();isdigit(t);t=getchar()) x=x*10+(t^48);
}
int t;
char ans[N];
string s;
map<char, int> mp, vis;
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> s;
s = '1'+s;
int len = s.size(), tt = 0;
mp.clear(); vis.clear(); me(ans);
for(int i = 1; i < len; i ++)
mp[s[i]] = i;
for(int i = 1; i < len; i ++){
if(vis[s[i]]) continue;
while(ans[tt]<s[i]&&mp[ans[tt]]>i)
vis[ans[tt--]] = 0;
ans[++tt] = s[i];
vis[s[i]] = 1;
}
for(int i = 1; i <= tt; i ++)
cout << ans[i];
cout << endl;
}
return 0;
}
Java代码实现:
import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int t = in.nextInt();
while(t-->0) {
String s = in.next();
HashMap<Integer, Integer> mp = new HashMap<>();
HashMap<Integer, Integer> vis = new HashMap<>();
for(int i = 0; i < s.length(); i ++) {
mp.put(s.charAt(i)-'a', i);
}
int tt = 0;
char [] ans = new char[100010];
for(int i = 0; i < s.length(); i ++) {
int x = s.charAt(i)-'a';
if(vis.get(x)!=null&&vis.get(x)==1) continue;
while(ans[tt]<s.charAt(i)&&mp.get(ans[tt]-'a')!=null&&mp.get(ans[tt]-'a')>i) {
vis.put(ans[tt--]-'a', 0);
}
ans[++tt] = s.charAt(i);
vis.put(x, 1);
}
for(int i = 1; i <= tt; i ++)
System.out.print(ans[i]);
System.out.println();
}
}
}
U1S1,用Java来A题真的好累哦~,还是C++香!