Lweb and String(set)
来源:互联网 发布:淘宝哪些零食好吃 编辑:程序博客网 时间:2024/05/20 01:08
Lweb and String
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1301 Accepted Submission(s): 659
Problem Description
Lweb has a string S.
Oneday, he decided to transform this string to a new sequence.
You need help him determine this transformation to get a sequence which has the longest LIS(Strictly Increasing).
You need transform every letter in this string to a new number.
A is the set of letters of S, B is the set of natural numbers.
Every injection f:A→B can be treat as an legal transformation.
For example, a String “aabc”, A={a,b,c}, and you can transform it to “1 1 2 3”, and the LIS of the new sequence is 3.
Now help Lweb, find the longest LIS which you can obtain from S.
LIS: Longest Increasing Subsequence. (https://en.wikipedia.org/wiki/Longest_increasing_subsequence)
Input
The first line of the input contains the only integer T,(1≤T≤20).
Then T lines follow, the i-th line contains a string S only containing the lowercase letters, the length of S will not exceed 105.
Output
For each test case, output a single line “Case #x: y”, where x is the case number, starting from 1. And y is the answer.
Sample Input
2
aabcc
acdeaa
Sample Output
Case #1: 3
Case #2: 4
根据题意,就是寻找共出现了几个不同的元素`
get:
s.begin()
s.end()
s.clear()
s.empty()
s.max_size()
s.size()
#include <iostream>#include <cstring>#include <cstdio>#include <set>using namespace std;char m[12121112];set<char> k;int main(){ int t; cin>>t; for(int i=1;i<=t;i++) { cin>>m; for(int j=0;m[j];j++) { k.insert(m[j]);//插入 } cout<<"Case #"<<i<<": "<<k.size()<<endl;//输出个数 k.clear(); } return 0;}
- Lweb and String(set)
- Lweb and String
- Lweb and String
- HDU5842-Lweb and String
- hdu5842-Lweb and String
- hdu 5842 Lweb and String
- HDU 5842 Lweb and String
- hdu 5842 Lweb and String
- HDU 5842 Lweb and String
- HDU 5842 Lweb and String【】
- hdu 5842 Lweb and String
- HDU 5842Lweb and String
- hdu Lweb and String ( LIS)
- 杭电5842之Lweb and String
- hdoj 5835 Danganronpa 5842 Lweb and String
- hdu 5842 Lweb and String【水题】
- HDU 5842 Lweb and String(水题)
- HDU 5842 Lweb and String (神坑)
- 实现点击单选按钮后面的文字说明自动选中相应单选按钮功能
- FP-growth算法高效发现频繁项集
- 在Updata中的continue,断点调试结果与运行结果不一样
- 小米的疯狂进化论
- 文章标题
- Lweb and String(set)
- 和μCOS走完一生
- HDU 6124 Euler theorem【】
- HDU
- Python 成长之路
- 全连接层的作用
- [python3.6 flask web学习]Flask用户权限管理
- Android7.0应用程序自助更新跳转安装界面出现解析包出错
- Android 简单的点击震动