UVA11107 Life Forms SA模板

Life Forms

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 16827		Accepted: 4943

Description

You may have wondered why most extraterrestrial life forms resemble humans, differing by superficial traits such as height, colour, wrinkles, ears, eyebrows and the like. A few bear no human resemblance; these typically have geometric or amorphous shapes like cubes, oil slicks or clouds of dust.

The answer is given in the 146th episode of Star Trek - The Next Generation, titled The Chase. It turns out that in the vast majority of the quadrant's life forms ended up with a large fragment of common DNA.

Given the DNA sequences of several life forms represented as strings of letters, you are to find the longest substring that is shared by more than half of them.

Input

Standard input contains several test cases. Each test case begins with 1 ≤ n ≤ 100, the number of life forms. n lines follow; each contains a string of lower case letters representing the DNA sequence of a life form. Each DNA sequence contains at least one and not more than 1000 letters. A line containing 0 follows the last test case.

Output

For each test case, output the longest string or strings shared by more than half of the life forms. If there are many, output all of them in alphabetical order. If there is no solution with at least one letter, output "?". Leave an empty line between test cases.

Sample Input

3
abcdefg
bcdefgh
cdefghi
3
xxx
yyy
zzz
0

Sample Output

bcdefg
cdefgh

?

Source

【题解】

UVA炸了，在POJ上交的

把所有的串连起来，串尾加分隔符，一来识别串尾，二来防止跟后面的串拼起来一块与其他串组成LCP，分组时会出现错误

二分答案分组，看每个组里是否有大于n/2个串即可

细节很多，关键是要输出方案。。。还要做很鬼畜的标记，各种判断标识符。。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <algorithm>
 #include <queue>
 #include <vector>
 #include <cmath>
 #define min(a, b) ((a) < (b) ? (a) : (b))
 #define max(a, b) ((a) > (b) ? (a) : (b))
 #define abs(a) ((a) < 0 ? (-1 * (a)) : (a))
 template <class T>
 inline void swap(T& a, T& b)
 {
     T tmp = a;a = b;b = tmp;
 }
 inline void read(int &x)
 {
     x = ;char ch = getchar(), c = ch;
     while(ch < '' || ch > '') c = ch, ch = getchar();
     while(ch <= '' && ch >= '') x = x *  + ch - '', ch = getchar();
     if(c == '-') x = -x;
 }
 const int INF = 0x3f3f3f3f;
 const int MAXN =  + ;
 struct SuffixArray
 {
     char s[MAXN];int sa[MAXN], t1[MAXN], t2[MAXN], rank[MAXN], height[MAXN], c[MAXN], n;
     void clear(){n = ;memset(sa, , sizeof(sa));}
     void build_sa(int m)
     {
         int i, *x = t1, *y = t2;
         for(i = ;i <= m;++ i) c[i] = ;
         for(i = ;i <= n;++ i) ++ c[x[i] = s[i]];
         for(i = ;i <= m;++ i) c[i] += c[i - ];
         for(i = n;i >= ;-- i) sa[c[x[i]] --] = i;
         for(int k = ;k <= n;k <<= )
         {
             int p = ;
             for(i = n - k + ;i <= n;++ i) y[++ p] = i;
             for(i = ;i <= n;++ i) if(sa[i] > k) y[++ p] = sa[i] - k;
             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[]] = ++ p;
             for(i = ;i <= n;++ i) x[sa[i]] = sa[i] + k <= n && sa[i - ] + k <= n && y[sa[i]] == y[sa[i - ]] && y[sa[i] + k] == y[sa[i - ] + k] ? p : ++ p;
             if(p >= n) break;m = p;
         }
     }
     void build_height()
     {
         int i,j,k = ;
         for(i = ;i <= n;++ i) rank[sa[i]] = i;
         for(i = ;i <= n;++ i)
         {
             if(k) -- k; if(rank[i] == ) continue;
             j = sa[rank[i] - ];
             while(i + k <= n && j + k <= n && s[i + k] == s[j + k]) ++ k;
             height[rank[i]] = k;
         }
     }
 }A;
 int cnt, n, tmp, ans, num[MAXN], vis[MAXN], tt = ;
 std::vector<int> node;
 int check(int x)
 {
     int num = , flag = , t = , f = ;
     for(int i = ;i <= n;++ i)
     {
         if(A.s[A.sa[i]] == 'z' +  || A.s[A.sa[i - ]] == 'z' +  || ::num[A.sa[i] + x] != ::num[A.sa[i]] || ::num[A.sa[i - ] + x] != ::num[A.sa[i - ]])
         {
             num = , ++ tt, t = , f = ;
             continue;
         }
         if(A.height[i] >= x)
         {
             if(t)
             {
                 t = ;
                 vis[::num[A.sa[i - ]]] = tt;
                 ++ num;
             }
             if(vis[::num[A.sa[i]]] == tt) continue;
             ++ num, vis[::num[A.sa[i]]] = tt;
         }
         else num = , ++ tt, t = , f = ;
         if(num >= cnt/ +  && f)
         {
             if(!flag) node.clear();
             node.push_back(i);
             f = ;
             flag =;
         }
     }
     return flag;
 }
 void put()
 {
     for(int i = ;i < node.size();++ i)
     {
         for(int j = A.sa[node[i]], k = ;k <= ans;++ k, ++ j)
             printf("%c", A.s[j]);
         putchar('\n');
     }
 }
 int main()
 {
     while(scanf("%d", &cnt) != EOF && cnt)
     {
         if(cnt == )
         {
             scanf("%s", A.s + );
             printf("%s\n\n", A.s + );
             continue;
         }
         A.clear();n = ;tmp = ;
         for(int i = ;i <= cnt;++ i)
         {
             scanf("%s", A.s + n + );
             int t = n + ;
             tmp = max(tmp, strlen(A.s + n + ));
             n += strlen(A.s + n + );
             A.s[++ n] =  'z' + ;
             for(int j = t;j <= n;++ j) num[j] = i;
         }
         A.n = n;
         A.build_sa('z' + );
         A.build_height();
         int l = , r = tmp, mid;ans = ;
         while(l <= r)
         {
             mid = (l + r) >> ;
             if(check(mid)) l = mid + , ans = mid;
             else r = mid - ;
         }
         if(ans)    put();
         else printf("?\n");
         putchar('\n');
     }
     return ;
 }

UVA11107