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)
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.
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
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5842
***************************************************
题意：我只能说题意神马都是浮云，纯属干扰，直接看代码吧
1 #include<stdio.h> 2 #include<string.h> 3 #include<iostream> 4 #include<algorithm> 5 #include<math.h> 6 using namespace std; 7 #define N 1100 8 9 char s[110000]; 10 int v[27]; 11 12 int main() 13 { 14 int i,T,k=1,len; 15 16 scanf("%d", &T); 17 18 while(T--) 19 { 20 memset(v, 0, sizeof(v)); 21 int ans=0; 22 scanf("%s",s); 23 len=strlen(s); 24 25 for(i=0;i<len;i++) 26 v[s[i]-'a']=1; 27 28 for(i=0;i<27;i++) 29 if(v[i]) 30 ans++; 31 32 printf("Case #%d: %d\n", k++,ans); 33 } 34 return 0; 35 }