POJ3450 Corporate Identity —— 后缀数组 最长公共子序列

题目链接：https://vjudge.net/problem/POJ-3450

Corporate Identity

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 8046		Accepted: 2710

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

Source

CTU Open 2007

题意：

给出n个字符串，求这n个字符串的最长公共子序列，输出字典序最小的一个。

题解：

1.将n个字符串拼接在一起，并且相邻两个之间用分隔符隔开，并且分隔符应各异。因此得到新串。

2.求出新串的后缀数组，然后二分公共子串的长度mid：可知当前的mid可将新串的后缀按排名的顺序将其分成若干组，且每一组的最长公共前缀都大于等于mid，于是就在每一组内统计出现了多少个字符串，如果等于n，即表明当前mid合法，否则不合法，因此可以根据此规则最终求得长度。

3.由于题目还要求输出字典序最小的。所以，如果当前mid合法，那么就记录下公共子串的起始点和结束点。因为枚举是按sa[i]从小到大的顺序，因此在同一个mid下，第一组符合条件的公共子串即为字典序最小的。

代码如下：

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <vector>
 #include <cmath>
 #include <queue>
 #include <stack>
 #include <map>
 #include <string>
 #include <set>
 using namespace std;
 typedef long long LL;
 const int INF = 2e9;
 const LL LNF = 9e18;
 const int MOD = 1e9+;
 const int MAXN = 1e6+;

 int id[MAXN];   //记录属于哪个字符串
 int r[MAXN], sa[MAXN], Rank[MAXN], height[MAXN];
 int t1[MAXN], t2[MAXN], c[MAXN];

 bool cmp(int *r, int a, int b, int l)
 {
     return r[a]==r[b] && r[a+l]==r[b+l];
 }

 void DA(int str[], int sa[], int Rank[], int height[], int n, int m)
 {
     n++;
     int i, j, p, *x = t1, *y = t2;
     for(i = ; i<m; i++) c[i] = ;
     for(i = ; i<n; i++) c[x[i] = str[i]]++;
     for(i = ; i<m; i++) c[i] += c[i-];
     for(i = n-; i>=; i--) sa[--c[x[i]]] = i;
     for(j = ; j<=n; j <<= )
     {
         p = ;
         for(i = n-j; i<n; i++) y[p++] = i;
         for(i = ; i<n; i++) if(sa[i]>=j) y[p++] = sa[i]-j;

         for(i = ; i<m; i++) c[i] = ;
         for(i = ; i<n; i++) c[x[y[i]]]++;
         for(i = ; i<m; i++) c[i] += c[i-];
         for(i = n-; i>=; i--) sa[--c[x[y[i]]]] = y[i];

         swap(x, y);
         p = ; x[sa[]] = ;
         for(i = ; i<n; i++)
             x[sa[i]] = cmp(y, sa[i-], sa[i], j)?p-:p++;

         if(p>=n) break;
         m = p;
     }

     int k = ;
     n--;
     for(i = ; i<=n; i++) Rank[sa[i]] = i;
     for(i = ; i<n; i++)
     {
         if(k) k--;
         j = sa[Rank[i]-];
         while(str[i+k]==str[j+k]) k++;
         height[Rank[i]] = k;
     }
 }

 bool vis[];
 int Le, Ri;
 bool test(int n, int len, int k)
 {
     int cnt = ;
     memset(vis, false, sizeof(vis));
     for(int i = ; i<=len; i++)
     {
         if(height[i]<k)
         {
             cnt = ;
             memset(vis, false, sizeof(vis));
         }
         else
         {
             if(!vis[id[sa[i-]]]) vis[id[sa[i-]]] = true, cnt++;
             if(!vis[id[sa[i]]]) vis[id[sa[i]]] = true, cnt++;
             if(cnt==n)
             {
                 Le = sa[i]; Ri = sa[i]+k-;
                 return true;
             }
         }
     }
     return false;
 }

 char str[MAXN];
 int main()
 {
     int n;
     while(scanf("%d", &n)&&n)
     {
         int len = ;
         for(int i = ; i<n; i++)
         {
             scanf("%s", str);
             int LEN = strlen(str);
             for(int j = ; j<LEN; j++)
             {
                 r[len] = str[j]-'a'+;
                 id[len++] = i;
             }
             r[len] = +i;  //分隔符要各异
             id[len++] = i;
         }
         r[len] = ;
         DA(r,sa,Rank,height,len,+n);

         int L = , R = strlen(str);
         while(L<=R)
         {
             int mid = (L+R)>>;
             if(test(n,len,mid))
                 L = mid + ;
             else
                 R = mid - ;
         }

         if(R==) puts("IDENTITY LOST");
         else
         {
             for(int i = Le; i<=Ri; i++)
                 printf("%c", r[i]+'a'-);
             putchar('\n');
         }
     }
 }