Corporate Identity HDU - 2328 (kmp+枚举)

最新推荐文章于 2020-03-25 20:25:41 发布

原创最新推荐文章于 2020-03-25 20:25:41 发布 · 360 阅读

2 ·

CC 4.0 BY-SA版权

KMP 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种算法，用于从多个商标中找出最长的公共字母序列，以帮助公司更新其企业标识，同时保持原有的品牌认知度。该算法使用KMP字符串匹配技术实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Corporate Identity

HDU - 2328

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

code：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
int Next[205];
void getNext(string w,int len){
    int i = -1,j = 0;
    memset(Next,0,sizeof(Next));
    Next[0] = -1;
    while(j < len){
        if(i == -1 || w[i] == w[j]){
            i++,j++;
            Next[j] = i;
        }
        else
            i = Next[i];
    }
}
bool kmp(string w,int m,string s,int n){
    int i = 0,j = 0;
    getNext(w,m);
    while(j < n){
        if(i == -1 || w[i] == s[j])
            i++,j++;
        else
            i = Next[i];
        if(i >= m){
            return true;
        }
    }
    return false;
}
int main(){
    int n;
    while(~scanf("%d",&n)&&n){
        string str[4009];
        int i,j,k;
        for(i = 0; i < n; i++){
            cin >> str[i];
        }
        bool flag = false;
        string ans;
        for(i = 0; i < str[0].length(); i++){
            for(j = i; j < str[0].length(); j++){
                string w = str[0].substr(i,j-i+1);
                for(k = 1; k < n; k++){
                    if(!kmp(w,w.length(),str[k],str[k].length()))
                        break;
                }
                if(k >= n){
                    if(!flag || w.length() > ans.length()){
                        ans = w;
                        if(!flag)
                            flag = true;
                    }
                    else{
                        if(w.length() == ans.length() && w.compare(ans)<0){
                            ans = w;
                        }
                    }
                }
            }
        }
        if(!flag)
            cout << "IDENTITY LOST" << endl;
        else
            cout << ans << endl;
    }
    return 0;
}