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): 422    Accepted Submission(s): 276

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
  
  

 

Authorj

UESTC

 

Source

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

样例说明

2个测试样例，每次输入一个字符串

第一次输入aabc

第二次输入acdeaa

对应的输出：

第一个字符串的输出为3

第二个字符串的输出为4

最初以为是求最长上升序列，能通过样例，但提交后结果不对，后来才注意到是要将字母翻译成数字，然后求最长的严格上升序列，也就是说数字和字母并不需要按顺序一一对应，而是要使得翻译后的数字串能得到尽可能长的上升序列，其实就是就职于字符串中不同字母的个数。

分别用cin和scanf输入，时间相差很远。

代码

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int T,ans;
int b[130];
char ss[100005];
int main()
{
	scanf("%d",&T);
	for(int t=1;t<=T;t++)
	{
		scanf("%s",ss);
		ans=0;
		memset(b,0,sizeof(b));
		for(int i=0;i<strlen(ss);i++)
		{
			if(!b[ss[i]])
			{
				b[ss[i]]=1;
				ans++;
			}
		}
		printf("Case #%d: %d\n",t,ans);
	}
	return 0;
}

题目链接→ HDU 5842 Lweb and String