Lexicographically Maximum Subsequence CodeForces
来源:互联网 发布:淘宝网的域名怎么设置 编辑:程序博客网 时间:2024/05/18 01:22
题目链接: Lexicographically Maximum Subsequence CodeForces - 197C
题目大意
给你一个只包含小写字母大字符串s(
思路
字典序要大, 那么第一个字母一定要是所有字母里面最大的, 然后第二个字母一定要是第一个字母后面所有字母中最大的, 依次类推
所以这个子序列: 原来字符串的顺序, 一定单调不递减(每次都取最大的)
可以将字符依次push进单调栈来得到, 代码简短高效
代码
#include <bits/stdc++.h>using namespace std;const int maxn = 2e5;char s[maxn], ans[maxn];int main(){ cin >> s; int len = 0; for(int i=0; s[i]!='\0'; ++i) { while(len > 0 && ans[len-1] < s[i]) --len; ans[len++] = s[i]; } for(int i=0; i<len; ++i) cout << ans[i]; cout << endl; return 0;}
阅读全文
0 0
- Lexicographically Maximum Subsequence CodeForces
- Codeforces 124c Lexicographically Maximum Subsequence
- CodeForces 197C Lexicographically Maximum Subsequence
- codeforces 197C Lexicographically Maximum Subsequence
- codeforce Lexicographically Maximum Subsequence
- Codeforces Round #124 (Div. 2) / C. Lexicographically Maximum Subsequence
- Maximum Subsequence CodeForces
- codeforces 888E Maximum Subsequence
- Codeforces-888E:Maximum Subsequence(思维)
- 【Codeforces Round #172】Codeforces 280D k-Maximum Subsequence Sum
- codeforces Educational Codeforces Round 32 E. Maximum Subsequence
- [题解]codeforces 280d k-Maximum Subsequence Sum
- codeforces 888 E. Maximum Subsequence(好题)
- codeforces 888E Maximum Subsequence (折半枚举 双向搜索)
- Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- PAT1007. Maximum Subsequence Sum
- PAT_1007: Maximum Subsequence Sum
- BZOJ 4241 历史研究 (回滚莫队)
- Android ViewPager用法解析
- JDBC高级编程和DAO
- spring学习之---深入理解容器中的Bean
- LCT例题·BZOJ2049洞穴勘测、BZOJ3669魔法森林
- Lexicographically Maximum Subsequence CodeForces
- 1055. The World's Richest (25)
- 将需要人为触发的事件放在定时器或者循环中,程序有可能产生Bug
- POI操作Excel
- 【玩转Eclipse】——eclipse实现代码块自定义折叠---[类似于VS中的#region……#endregion]
- 《剑指offer》笔记-第4章(2)
- 多维动态规划 (共六题)
- BZOJ4216【Pig】
- Android实现照相机拍照