SPOJ LCS2（后缀自动机）

(http://acm.hust.edu.cn/vjudge/contest/view.action?cid=106071#problem/B)
题意：给定n个串，求最长相同子串。
解法：对第一个构造后缀自动机，记录la[p],为前k个串在这以点的最常匹配长度。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <queue>
#include <tr1/unordered_set>
//#include <tr1/unordered_map>
#include <bitset>
//#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

#define lson l, m, ls[rt]
#define rson m+1, r, rs[rt]
#define inf 1e9
#define debug(a) cout << #a" = " << (a) << endl;
#define debugarry(a, n) for (int i = 0; i < (n); i++) { cout << #a"[" << i << "] = " << (a)[i] << endl; }
#define clr(x, y) memset(x, y, sizeof x)
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) \
    for(i=a;a<b?i<=b:i>=b;a<b?i++:i--)

const int maxn=2*100000+30;

struct suffix_automaton{
    int son[maxn][30],pre[maxn],step[maxn];
    int last,si;
    void pushback(int v)
    {
        step[++si]=v;
        pre[si]=-1;
        clr(son[si],-1);
    }
    void Extend(int ch)
    {
        pushback(step[last]+1);
        int p=last,np=si;
        while(p!=-1&&son[p][ch]==-1)
            son[p][ch]=np,
            p=pre[p];
        if(p==-1) pre[np]=0;
        else{
            int q=son[p][ch];
            if(step[q]==step[p]+1) pre[np]=q;
            else{
                pushback(step[p]+1);
                int nq=si;
                memcpy(son[nq],son[q],sizeof son[q]);
                pre[nq]=pre[q];
                pre[q]=pre[np]=nq;
                while(p!=-1&&son[p][ch]==q)
                    son[p][ch]=nq,p=pre[p];
            }
        }
        last=np;
    }
    void init()
    {
        si=last=0;
        clr(son[0],-1);
        pre[0]=-1;
    }
    int le[maxn],curle[maxn];
    int pos[maxn],cnt[maxn];
    void cca()
    {
        stack<int>Q;
        for(int i=0;i<=si;i++) cnt[i]=0;
        for(int i=0;i<=si;i++) if(pre[i]==-1)
            cnt[pre[i]]++;
        for(int i=0;i<=si;i++) if(!cnt[i])
            Q.push(i);
        int len=0;
        while(Q.size())
        {
            int q=Q.top();Q.pop();
            pos[len++]=q;
            if(~pre[q]&&!--cnt[pre[q]])
                Q.push(pre[q]);
        }
    }
    int solve(char *s)
    {
        cca();
        for(int i=0;i<=si;i++)
            le[i]=step[i];
        while(~scanf("%s",s)){
            for(int i=0;i<=si;i++)
                curle[i]=-1;
            int p=0,l=0;
            for(int i=0;s[i];i++){
                int c=s[i]-'a';
                while(p!=-1&&son[p][c]==-1)
                    p=pre[p];
                if(p==-1) p=0,l=0;
                else{
                    l=min(l,step[p]);
                    p=son[p][c];
                    l++;
                }
                curle[p]=max(curle[p],l);
            }
            for(int i=0;i<=si;i++) if(pre[pos[i]]!=-1)
            {
                if( curle[pos[i]] != -1 )
                    curle[pre[pos[i]]] = step[pre[pos[i]]];
            }
            for(int i=0;i<=si;i++)
                le[i] = min(le[i],curle[i]);
        }
        int ans=0;
        for(int i=0;i<=si;i++)
            ans=max(ans,le[i]);
        return ans;
    }
}su;

char s[maxn];

int main()
{
//  freopen("input.txt","r",stdin);
    //freopen("out2.txt","w",stdout);
    while(~scanf("%s",s)){
        su.init();
        for(int i=0;s[i];i++)
            su.Extend(s[i]-'a');
        printf("%d\n",su.solve(s));
    }
    return 0;
}