Lweb and String HDU

 

一水题

 

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 SS, BB 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 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)

Then T lines follow, the i-th line contains a string S only containing the lowercase letters, the length of SS 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

题意：

咱也不知道这道题什么情况，搞半天是求多少种不同字符

#include <stdio.h>
#include <string.h>

int main()
{
    int len, i, t, book[105];
    char a[100005];
    scanf("%d", &t);
    int cas = 0, ans;
    while(t--)
    {
        scanf("%s", a);
        ans = 0;
        len = strlen(a);
        memset(book, 0, sizeof(book));
        for(i=0; i<len; i++)
        {
            if(book[a[i]-'a']==0)
            {
                ans++;
                book[a[i]-'a'] = 1;
            }
        }
        printf("Case %d: %d
", ++cas, ans);
    }
    return 0;
}