题目链接
题目要求N个子树中的最长公共相同子串,如果有多个的话,输出字典序最小的。
当然很多人是用KMP来写的,这里我的做法是用后缀数组+尺取,当然后缀数组+二分答案也是可行的解。我们先把所有的串放到一个长长的串中,并且都用一个大符号隔开,我们知道对于后缀数组sa,是按照字典序来排序的,所以我们这边其实已经处理好了同种长度下字典序最小的问题了,接着,我们就是要去处理最长的长度了,我们可以用枚举LCP来解决,也就是用了LCP的性质,如果我们现在取到的点在N个区间内都有覆盖,我们就可以来更新答案了。
2
adazzz
aszzc
ans:zz
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 9e5 + 7;
struct SA
{
int n, m;
int s[maxN];
int y[maxN], x[maxN], c[maxN], sa[maxN], rk[maxN], height[maxN];
inline void get_SA()
{
for(int i=1; i<=m; i++) c[i] = 0; //桶的初始化
for(int i=1; i<=n; i++) ++c[x[i] = s[i]];
for(int i=2; i<=m; i++) c[i] += c[i - 1]; //利用差分前缀和的思想知道每个关键字最多是在第几名
for(int i=n; i>=1; i--) sa[c[x[i]]--] = i;
for(int k=1; k<=n; k<<=1)
{
int num = 0;
for(int i=n - k + 1; i<=n; i++) y[++num] = i;
for(int i=1; i<=n; i++) if(sa[i] > k) y[++num] = sa[i] - k; //是否可以作为第二关键字
for(int i=1; i<=m; i++) c[i] = 0;
for(int i=1; i<=n; i++) c[x[i]]++; //因为上一次循环已经求出这次的第一关键字了
for(int i=2; i<=m; i++) c[i] += c[i - 1];
for(int i=n; i>=1; i--) //在同一第一关键字下,按第二关键字来排
{
sa[c[x[y[i]]]--] = y[i];
y[i] = 0;
}
swap(x, y);
x[sa[1]] = 1; num = 1;
for(int i=2; i<=n; i++)
{
x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? num : ++num;
}
if(num == n) break;
m = num;
}
}
inline void get_height()
{
int k = 0;
for(int i=1; i<=n; i++) rk[sa[i]] = i;
for(int i=1; i<=n; i++)
{
if(rk[i] == 1) continue; //第一名的height为0
if(k) k--; //height[i] >= height[i - 1] - 1
int j = sa[rk[i] - 1];
while(j + k <= n && i + k <= n && s[i + k] == s[j + k]) k++;
height[rk[i]] = k;
}
}
inline void clear()
{
n = 0; m = 5000;
}
} sa;
int N, len, str_end[maxN];
char s[205];
int vis[maxN], now_get;
struct BIT_Tree
{
int tree[maxN << 2];
inline void buildTree(int rt, int l, int r)
{
if(l == r) { tree[rt] = sa.height[l]; return; }
int mid = HalF;
buildTree(Lson); buildTree(Rson);
tree[rt] = min(tree[lsn], tree[rsn]);
}
inline int query(int rt, int l, int r, int ql, int qr)
{
if(ql <= l && qr >= r) return tree[rt];
int mid = HalF;
if(qr <= mid) return query(QL);
else if(ql > mid) return query(QR);
else return min(query(QL), query(QR));
}
} Tree;
int main()
{
while(scanf("%d", &N) && N)
{
sa.clear(); len = 0; for(int i=1; i<=N; i++) vis[i] = 0;
now_get = 0;
for(int i=1; i<=N; i++)
{
scanf("%s", s + 1);
len = (int)strlen(s + 1);
for(int j=1; j<=len; j++) sa.s[++sa.n] = s[j];
str_end[i] = sa.n;
sa.s[++sa.n] = 'a' + 26 + i;
}
sa.get_SA();
// for(int i=1; i<=sa.n; i++) printf("%d ", sa.sa[i]); puts("");
sa.get_height();
// for(int i=1; i<=sa.n; i++) printf("%d ", sa.height[i]); puts("");
Tree.buildTree(1, 1, sa.n);
int ans_len = 0, ans_beg = 0;
int l = 1, r = 1, tmp_id, tmp_len;
while(now_get < N)
{
tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[r]) - str_end);
if(!vis[tmp_id]) now_get ++;
vis[tmp_id]++;
r++;
}
tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
while(vis[tmp_id] > 1)
{
vis[tmp_id]--;
l++;
tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
}
if(l + 1 <= r - 1) ans_len = Tree.query(1, 1, sa.n, l + 1, r - 1);
if(ans_len) ans_beg = sa.sa[r - 1];
while(r <= sa.n)
{
tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[r]) - str_end);
if(sa.sa[r] == str_end[tmp_id] + 1) break;
vis[tmp_id]++;
tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
while(vis[tmp_id] > 1)
{
vis[tmp_id]--;
l++;
tmp_id = (int)(lower_bound(str_end + 1, str_end + N + 1, sa.sa[l]) - str_end);
}
if(ans_len < (tmp_len = Tree.query(1, 1, sa.n, l + 1, r)))
{
ans_len = tmp_len;
ans_beg = sa.sa[r];
}
r++;
}
if(ans_len)
{
for(int i=ans_beg; i<ans_beg + ans_len; i++) printf("%c", sa.s[i]); puts("");
}
else printf("IDENTITY LOST\n");
}
return 0;
}