[spoj1812]Longest Common Substring II && 后缀自动机

对第一个串建立后缀自动机

然后之后的每一个串放上去跑 记录每一个节点当前串匹配的最大长度

然后在每一个节点的最大长度为所有串匹配的最大长度的最小值

最后再在这些最小值里面选一个最大值

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#define SF scanf
#define PF printf
#define idx(c) (c-'a')
using namespace std;
typedef long long LL;
const int MAXN = 100000;
char s[MAXN+10];
int mn[MAXN*2+10], v[MAXN*2+10], sa[MAXN*2+10], n, mx[MAXN*2+10];
int len[MAXN*2+10];
int ch[MAXN*2+10][26], fa[MAXN*2+10], step[MAXN*2+10];
int last, ncnt;
struct SAM {
	
	SAM () { last = ++ncnt; }
	void extend(int c) {
		int p = last, np = last = ++ncnt;
		step[np] = step[p]+1;
		while(!ch[p][c] && p) ch[p][c] = np, p = fa[p];  
        if(!p) fa[np] = 1;  
        else {  
            int q = ch[p][c], nq;  
            if(step[q] == step[p]+1) fa[np] = q;  
            else {  
                nq = ++ncnt;  
                step[nq] = step[p]+1;  
                memcpy(ch[nq], ch[q], sizeof(ch[nq]));  
                fa[nq] = fa[q]; fa[np] = fa[q] = nq;  
                while(ch[p][c] == q && p) ch[p][c] = nq, p = fa[p];  
            }  
        }  
	}
	void build() {
		SF("%s", s);
		n = strlen(s);
		for(int i = 0; i < n; i++) 
			extend(idx(s[i]));
	}
	bool solve() {
		if(SF("%s", s) == EOF) return false;
		int u = 1, Len = strlen(s), cur = 0;
		memset(mx, 0, sizeof(mx));
		for(int i = 0; i < Len; i++) {
			int c = idx(s[i]);
			if(ch[u][c]) cur++, u = ch[u][c];
			else {
				while(!ch[u][c] && u) u = fa[u];
				if(!u) u = 1, cur = 0;
				else {
					cur = step[u]+1;
					u = ch[u][c];
				}
			}
			mx[u] = max(mx[u], cur);
		}
		for(int i = ncnt; i; i--) {
			u = sa[i];
			mn[u] = min(mn[u], mx[u]);
			if(mx[u] && fa[u]) mx[fa[u]] = step[fa[u]];
		}
		return true;
	}
} ac;
int main() {
	ac.build();
	for(int i = 1; i <= ncnt; i++)
		mn[i] = step[i];
	for(int i = 1; i <= ncnt; i++) 
		v[step[i]]++;
	for(int i = 1; i <= n; i++) v[i] += v[i-1];
	for(int i = 1; i <= ncnt; i++)
		sa[v[step[i]]--] = i;
	while(ac.solve())
		;
	int ans = 0;
	for(int i = 1; i <= ncnt; i++)
		ans = max(ans, mn[i]);
	PF("%d\n", ans);
}