poj 3450 Corporate Identity 【KMP】【求公共子串】
来源:互联网 发布:阿里云cdn协议跟随 编辑:程序博客网 时间:2024/06/05 08:11
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
3aabbaabbabbababbbbbbbabb2xyzabc0
Sample Output
abbIDENTITY LOST
题意:
给出多个字符串,求公共子串,如果没有输出 IDENTITY LOST;
AC代码:
#include<cstdio>#include<cstring>#include<cmath>#include<queue>#define mem(a, b) memset(a, (b), sizeof(a))#define Wi(a) while(a--)#define Si(a) scanf("%d", &a)#define Pi(a) printf("%d\n", (a))#define INF 0x3f3f3f3f#include<algorithm>#define N 100000+10using namespace std;char str[4001][201];int p[201];void getp(char *s){int len = strlen(s);p[0] = p[1] = 0;for(int i = 1; i < len; i++){int j = p[i];while(j && s[i]!=s[j]) j = p[j];p[i+1] = s[i]==s[j] ? j+1 : 0;}}bool find(char *a, char *b){int la = strlen(a);int lb = strlen(b);int j = 0;for(int i = 0; i < la; i++){while(j && a[i] != b[j]) j = p[j];if(a[i] == b[j]) j++;if( j >= lb) return true;}return false;}int main(){int n;while(Si(n)==1, n){for(int i = 0; i < n; i++) scanf("%s", str[i]);int l = strlen(str[0]);char ch[201], ans[201];mem(ans, '\0');for(int i = 0; i < l; i++){for(int j = i; j < l; j++){int m = 0;for(int k = i; k <= j; k++)ch[m++] = str[0][k];ch[m] = '\0';getp(ch);bool flag = true;for(int k = 1; k < n; k++){if(!find(str[k], ch)){flag = false; break;}}if(flag){if(strlen(ch) > strlen(ans)) strcpy(ans, ch);else if(strlen(ch)==strlen(ans) && strcmp(ch, ans) < 0) strcpy(ans, ch); }}}if(strlen(ans)==0) printf("IDENTITY LOST\n");else printf("%s\n", ans);}return 0;}
- poj 3450 Corporate Identity 【KMP】【求公共子串】
- poj 3450 Corporate Identity (KMP+最长公共子串)
- POJ 3450 Corporate Identity(KMP:最长连续公共子序列)
- POJ 3450 Corporate Identity(kmp求多个字符串的最长公共子串)
- POJ 3450 Corporate Identity 求所有字符的最长公共子串
- POJ3450 Corporate Identity(kmp,最长公共子串)
- POJ-3450-Corporate Identity(KMP)
- POJ 3450--->Corporate Identity(后缀数组求多个字符串的公共子串)
- POJ3450 Corporate Identity 最长公共子串
- [KMP或者暴力]POJ 3450 Corporate Identity
- POJ 3450 Corporate Identity 暴力枚举+KMP
- POJ 3450Corporate Identity(暴力枚举+KMP)
- POJ 3450 Corporate Identity KMP题解
- poj 3450 Corporate Identity(数据结构:KMP)
- poj 3450 Corporate Identity 【暴力KMP】
- POJ 3450--Corporate Identity【KMP && 枚举】
- 【poj 3450 Corporate Identity 】 KMP(暴力)
- [poj 3450]Corporate Identity[暴力枚举子串]
- 总结-Java何时需要使用多线程
- sublime 快捷键
- 【翻译自mos文章】Oracle GoldenGate 对IBM大型机 z/OS 2.1 和DB2 v11的支持
- Java多线程ExecutorService.shutdown什么时候执行
- TopCoder SRM 681 Div. 2 Problem 500 - ExplodingRobots (枚举)
- poj 3450 Corporate Identity 【KMP】【求公共子串】
- hdu1009
- 以创业者的姿态做一名工程师
- java synchronized详解(转载)
- 1025. PAT Ranking (25)
- Java开发环境搭建
- HDU2103Family planning
- poj 3080 Blue Jeans【KMP】【求公共子串】
- 51Nod 1289 大鱼吃小鱼(模拟 有趣)