2016中国大学生程序设计竞赛 - 网络选拔赛 1011 Lweb and String

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

aabcc
acdeaa

Sample Output
Case #:
Case #: 

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5842

***************************************************

题意：我只能说题意神马都是浮云，纯属干扰，直接看代码吧

 #include<stdio.h>
 #include<string.h>
 #include<iostream>
 #include<algorithm>
 #include<math.h>
 using namespace std;
 #define N 1100

 char s[];
 int v[];

 int main()
 {
     int i,T,k=,len;

     scanf("%d", &T);

     while(T--)
     {
         memset(v, , sizeof(v));
         int ans=;
         scanf("%s",s);
         len=strlen(s);

         for(i=;i<len;i++)
             v[s[i]-'a']=;

         for(i=;i<;i++)
             if(v[i])
             ans++;

       printf("Case #%d: %d\n", k++,ans);
     }
     return ;
 }