HDU - 2328 Corporate Identity 暴力枚举+kmp

HDU - 2328 Corporate Identity

题意：在多个母串中找到字典序最小的最长公共字串

题解：暴力枚举s[0]的所有字串，然后利用kmp去匹配其他串，找到最长且字典序最小的即可。
由于习惯把next数组开大了，导致超时好多次。。。

#include<iostream>
#include<algorithm>
#include<cstring>
#include<set>
using namespace std;
const int N=1e6+10;
int p[205];
string pp[4005];
inline void get_(string b,int m) {
	memset(p,-1,sizeof p);
	for(int j=-1,i=0; i<m;) {
		if(j==-1||b[i]==b[j])p[++i]=++j;
		else j=p[j];
	}
}
inline int solve(char a[],string b,int n,int m) {

	for(int i=0,j=0; i<n; i++) {
		while(j&&b[j]!=a[i])j=p[j];
		if(b[j]==a[i])j++;
		if(j==m)return 1;
	}
	return 0;
}
//bool cmp(string x,string y) {
//	if(x.size()!=y.size())return x.size()>y.size();
//	else return x<y;
//}
char s[4005][205];
int main() {
	int t;
	while(~scanf("%d",&t)) {
		if(!t)break;
		//int yy=0;
		int sum=-1;
		string res="";
		//	set<string>st;
		for(int i=0; i<t; i++)scanf("%s",s[i]);
		for(int i=0; i<strlen(s[0]); i++) {
			string ans="";
			for(int j=i; j<strlen(s[0]); j++) {
				ans+=s[0][j];
				get_(ans,j-i+1);
				int f=1;
				for(int k=1; k<t; k++) {
					if(solve(s[k],ans,strlen(s[k]),j-i+1))f++;
					else break;
				}
				if(f==t) {
					int l=ans.size();
					if(l>sum) {
						res=ans;
						sum=l;
					} else if(l==sum) {
						if(res>ans)
							res=ans;
					}
				}
			}
		}
		if(sum==-1)cout<<"IDENTITY LOST\n";
		else cout<<res<<endl;
//		if(!yy)cout<<"IDENTITY LOST\n";
//		else {
//			sort(pp,pp+yy,cmp);
			for(int i=0; i<yy; i++)cout<<pp[i]<<" ";
//			cout<<pp[0]<<endl;
//		}
//		string res;
//		int sum=-1;
//		if(st.size()==0)cout<<"IDENTITY LOST\n";
//		else {
//			set<string>::iterator i;
//			for(i=st.begin(); i!=st.end(); i++) {
//				int l=(*i).size();
//				if(l>sum) {
//					sum=l;
//					res=*i;
//				}
//			}
//			cout<<res<<endl;
//		}
	}
	return 0;
}

Problem 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

3
aabbaabb
abbababb
bbbbbabb
2
xyz
abc
0

Sample Output

abb

IDENTITY LOST