#include<stdio.h> #include<string.h> using namespace std; char a[100005]; int b[30]; int main() { int t; scanf("%d",&t); int ui=1; while(t--) { memset(b,0,sizeof(b)); scanf("%s",&a); int str=strlen(a); int ans=0; for(int i=0;i<str;i++) { if(b[a[i]-'a']==0) { b[a[i]-'a']=1; ans++; } } printf("Case #%d: %d\n",ui++,ans); } }

Lweb and String

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 191    Accepted Submission(s): 121 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中国大学生程序设计竞赛 - 网络选拔赛   Recommend wange2014   |   We have carefully selected several similar problems for you:   5841  5840  5839  5838  5837  人与人之间的信任呢。说好的LIS呢。