HDU 5842 Lweb and String【】

Lweb and String

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 541    Accepted Submission(s): 335

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
  
  

 

Author

UESTC

 

Source

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

 

 

题意，任选一个从26个字母的集合到整数的集合的映射，然后求每一行的字符数组对应的数列的最长递增子序列的长度的最大值。

因为映射可以任选，所以这个题目的意思是，输入一个字符串（只有小写字母），输出它有多少个不同的小写字母。

ZZ。。。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
typedef long long LL;
const int INF =0x7FFFFFFF;

const int M=1e5+1;

int main()
{
    int i,j,k,t;
    char str[M];
    int flag[M];
    scanf("%d",&t);
    rep(k,1,t+1){
      scanf("%s",str);
      MS(flag,0);
      int len=strlen(str);
      int MAX=0;
      rep(i,0,len)
      {
          if(!flag[str[i]-'a']){
                flag[str[i]-'a']=1;
                MAX++;
          }
      }
      printf("Case #%d: %d\n",k,MAX);
    }
    return 0;
}