1506G. Maximize the Remaining String

G. Maximize the Remaining String

贪心，放置时，如果前面一个小比他小，并且后面还有，那么就把前面的删除

#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 3;
#define int long long
string str;
char ans[N];
map<char,int>mp,vis;
signed main()
{int t;cin>>t;while (t--){int cnt = 0;cin>>str;int n = str.length();str = "1"+str;vis.clear(),mp.clear();memset(ans,0,sizeof ans);for (int i=1;i<=n;i++){mp[str[i]]=i;//记录最后一个在哪出现}for (int i=1;i<=n;i++){if (vis[str[i]]) continue;//如果前面出现了while (ans[cnt]<str[i]&&mp[ans[cnt]]>i)//如果他比这个字符小并且后面还有vis[ans[cnt--]] = 0;ans[++cnt] = str[i];vis[str[i]] = 1;}for (int i=1;i<=cnt;i++)cout<<ans[i];cout<<endl;}
}

1506G. Maximize the Remaining String相关推荐

CodeForces - 1506G Maximize the Remaining String(单调栈+贪心)
题目链接:点击查看题目大意:给出一个长度为 nnn 的字符串,假设共出现了 kkk 种字母,现在要求出一个长度为 kkk 的子序列,满足每种字母只出现一次,且字典序最大题目分析:和之前牛客上的一道 ...
Codeforeces #710 div3题解报告
A. Strange Table 题意:给你一个矩阵(n*m)的.这个矩阵从上到下由1,2,3````n * m填满. 再给你一个数x.问你在另一个矩阵(也是n * m,不过是从水平填起),这个x的位 ...
1050 String Subtraction
1050 String Subtraction (20 分) Given two strings S1 and S2, S=S1−S2 is defined to be the ...
PAT甲级 -- 1050 String Subtraction (20 分)
Given two strings S1 and S2, S=S1−S2 is defined to be the remaining string after taking ...
1050 String Subtraction (20 分)_10行代码AC
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 Given two strings S1 and S2, S=S1−S2 is defined to be ...
C++ PAT甲级 1050 String Subtraction (20分)
Given two strings S1 and S2, S=S1−S2is defined to be the remaining string aftertaking all the cha ...
PAT甲级1050 String Subtraction
题目 1050 String Subtraction (20 分) Given two strings S1 and S2 , S=S1−S2 is defined to be the remai ...
1050 String Subtraction
1050 String Subtraction Given two strings S1 and S2, S=S1−S2 is defined to be the remaining string a ...
java获取hdfs总大小_如何获取出HDFS已用空间/总空间的值。java FileSystem中有相关的方法吗？？？...
展开全部 public List getHdfsstatus() { if (conf == null) { conf = new Configuration(); conf.set("fs ...

1506G. Maximize the Remaining String

1506G. Maximize the Remaining String相关推荐

最新文章

热门文章