POJ 题目3450 Corporate Identity(KMP 暴力)
2017-05-13 09:02
483 查看
Corporate Identity
Description
Beside other services, ACM helps companies to clearly state their “corporate identity”, which includes company logo but also other signs, like trademarks. One of such companies is Internet Building Masters (IBM), which has recently asked ACM for a help with
their new identity. IBM do not want to change their existing logos and trademarks completely, because their customers are used to the old ones. Therefore, ACM will only change existing trademarks instead of creating new ones.
After several other proposals, it was decided to take all existing trademarks and find the longest common sequence of letters that is contained in all of them. This sequence will be graphically emphasized to form a new logo. Then, the old trademarks may
still be used while showing the new identity.
Your task is to find such a sequence.
Input
The input contains several tasks. Each task begins with a line containing a positive integer N, the number of trademarks (2 ≤ N ≤ 4000). The number is followed by N lines, each containing one trademark. Trademarks will be composed only from lowercase letters,
the length of each trademark will be at least 1 and at most 200 characters.
After the last trademark, the next task begins. The last task is followed by a line containing zero.
Output
For each task, output a single line containing the longest string contained as a substring in all trademarks. If there are several strings of the same length, print the one that is lexicographically smallest. If there is no such non-empty string, output
the words “IDENTITY LOST” instead.
Sample Input
Sample Output
Source
CTU Open 2007
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 5493 | Accepted: 2015 |
Beside other services, ACM helps companies to clearly state their “corporate identity”, which includes company logo but also other signs, like trademarks. One of such companies is Internet Building Masters (IBM), which has recently asked ACM for a help with
their new identity. IBM do not want to change their existing logos and trademarks completely, because their customers are used to the old ones. Therefore, ACM will only change existing trademarks instead of creating new ones.
After several other proposals, it was decided to take all existing trademarks and find the longest common sequence of letters that is contained in all of them. This sequence will be graphically emphasized to form a new logo. Then, the old trademarks may
still be used while showing the new identity.
Your task is to find such a sequence.
Input
The input contains several tasks. Each task begins with a line containing a positive integer N, the number of trademarks (2 ≤ N ≤ 4000). The number is followed by N lines, each containing one trademark. Trademarks will be composed only from lowercase letters,
the length of each trademark will be at least 1 and at most 200 characters.
After the last trademark, the next task begins. The last task is followed by a line containing zero.
Output
For each task, output a single line containing the longest string contained as a substring in all trademarks. If there are several strings of the same length, print the one that is lexicographically smallest. If there is no such non-empty string, output
the words “IDENTITY LOST” instead.
Sample Input
3 aabbaabb abbababb bbbbbabb 2 xyz abc 0
Sample Output
abb IDENTITY LOST
Source
CTU Open 2007
#include<stdio.h> #include<string.h> char str[4040][220]; int next[4040]; void getnext(char *s) { int len=strlen(s); int j=0,k=-1; next[0]=-1; while(j<=len) { if(k==-1||s[k]==s[j]) { k++; j++; next[j]=k; } else k=next[k]; } } int kmp(char *a,char *b) { int i,j; i=j=0; int n=strlen(a); int m=strlen(b); getnext(b); while(i<n) { if(j==-1||a[i]==b[j]) { i++; j++; } else j=next[j]; if(j==m) return 1; } return 0; } int main() { int n; while(scanf("%d",&n),n) { int i,j,k; for(i=0;i<n;i++) { scanf("%s",str[i]); } int len=strlen(str[0]); char temp[220],ans[220]=""; for(i=0;i<len;i++) { int cnt=0; for(j=i;j<len;j++) { temp[cnt++]=str[0][j]; temp[cnt]='\0'; // getnext(temp); int flag=0; for(k=1;k<n;k++) { if(!kmp(str[k],temp)) { flag=1; break; } } if(!flag) { if(strlen(temp)>strlen(ans)||(strlen(temp)==strlen(ans)&&strcmp(temp,ans)<0)) memcpy(ans,temp,sizeof(temp)); } } } if(strlen(ans)==0) printf("IDENTITY LOST\n"); else printf("%s\n",ans); } }
相关文章推荐
- POJ 题目3450 Corporate Identity(KMP 暴力)
- poj 3450 KMP+暴力枚举(类似于3080)
- [KMP或者暴力]POJ 3450 Corporate Identity
- poj 3450 Corporate Identity(二分长度 + 暴力kmp)
- poj 3450 Corporate Identity 【暴力KMP】
- POJ 3080 Blue Jeans(暴力枚举+KMP 类似POJ 3450)
- POJ 题目3080 Blue Jeans(KMP+暴力)
- poj 3080(3450) KMP(暴力也能过) 多个串的最长公共子串
- POJ 1226 Substrings KMP暴力 或 后缀数组
- poj 3450 Corporate Identity 【KMP】【求公共子串】
- poj1226 Substrings (应该用kmp,但是数据弱,暴力枚举就行了)
- poj KMP题目总汇
- [省选前题目整理][POJ 2699]The Maximum Number of Strong Kings(暴力枚举+最大流)
- poj 3080 kmp求解多个字符串的最长公共字串,(数据小,有点小暴力 16ms)
- POJ 3450 Corporate Identity (KMP+暴搞)
- poj 3080 KMP+暴力
- poj--3450 KMP求多个字符串的最长公共子串
- poj 2406 Power Strings(数据结构:KMP||暴力)
- poj kmp 题目汇总 -- 待做
- POJ 3080 Blue Jeans (KMP || 暴力)