Lweb and String HDU - 5842（水题）

Lweb has a string SS.

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.

AA is the set of letters of SS, BB is the set of natural numbers.

Every injection f:A→Bf:A→B can be treat as an legal transformation.

For example, a String “aabc”, A={a,b,c}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 SS.

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)T,(1≤T≤20).

Then TT lines follow, the i-th line contains a string SS only containing the lowercase letters, the length of SS will not exceed 105105.
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
题意就是对于这个序列里面的字母，要给每种字符赋予一个数值，问字母变为数字之后的序列的最长上升子序列长度是多少。
想明白之后就是这个序列有多少种字母。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

string s;

int main()
{
	int t;
	scanf("%d",&t);
	int k=0;
	while(t--)
	{
		cin>>s;
		int len=s.length();
		sort(s.begin(),s.end());
		int lenn=unique(s.begin(),s.end())-s.begin();
		printf("Case #%d: %d\n",++k,lenn);
	}
}

努力加油a啊，(^o)/~