Relevant Phrases of Annihilation（后缀数组+二分）

#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
const int maxn = 2000000+1000;
int t1[maxn],t2[maxn],c[maxn];
int n;
bool cmp(int *r, int a, int b, int l){
    return r[a]==r[b]&&r[a+l]==r[b+l];
}
int len = 0;

void da(int str[], int sa[], int rank[], int height[], int n, int m){
    n++;
    int i, j, p, *x = t1, *y = t2;
    for(int i = 0;i<m;++i)c[i] = 0;
    for(int i = 0;i<n;++i)c[x[i]=str[i]]++;
    for(int i = 1;i<m;++i)c[i]+=c[i-1];
    for(int i =n-1;i>=0;i--)sa[--c[x[i]]] = i;
    for(j = 1;j<=n;j<<=1){
        p = 0;
        for(i = n-j;i<n;++i)y[p++] = i;
        for(i = 0;i<n;++i)if(sa[i]>=j)y[p++] = sa[i] - j;
        for(i = 0;i<m;++i)c[i] = 0;
        for(i = 0;i<n;++i)c[x[y[i]]]++;
        for(i = 1;i<m;++i)c[i]+=c[i-1];
        for(i = n-1;i>=0;--i)sa[--c[x[y[i]]]]  =y[i];
        swap(x,y);
        p = 1;
        x[sa[0]] = 0;
        for(i = 1;i<n;++i)
            x[sa[i]] = cmp(y,sa[i-1],sa[i],j)?p-1:p++;
        if(p>=n)break;
        m = p;

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

int Rank[maxn],height[maxn];
char str[maxn];
int r[maxn],sa[maxn];
int s[maxn];
int id[maxn];
int mx[1000],mi[1000];
const int INF = 0x3f3f3f3f;
int check(int x){
    for (int i = 0;i <= n + 1;i++) mi[i] = INF, mx[i] = 0;
    for(int i = 2;i<=len;++i){
        if(height[i]<x){
            for(int j = 1;j<=n;++j)mx[j] = 0,mi[j] = INF;
            mx[id[sa[i]]] = sa[i],mi[id[sa[i]]] = sa[i];
        }
        else{
            mx[id[sa[i]]] = max(mx[id[sa[i]]],sa[i]);
            mi[id[sa[i]]] = min(mi[id[sa[i]]],sa[i]);
            mx[id[sa[i-1]]] = max(mx[id[sa[i-1]]],sa[i-1]);
            mi[id[sa[i-1]]] = min(mi[id[sa[i-1]]],sa[i-1]);
            int flag = 0;
            for(int j = 1;j<=n;++j){
                if(mx[j]-mi[j]<x){
                    flag = 1;
                    break;
                }
            }
            if(!flag){
                //cout<<x<<":"<<endl;
                return 1;
            }
        }
    }
    return 0;
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){

        scanf("%d",&n);
        int lenx = 0;
        len = 0;
        for(int i = 1;i<=n;++i){
            scanf("%s",str);
            int lens = strlen(str);
            lenx = max(lens,lenx);
            for(int j = 0;j<lens;++j){
               id[len] = i; s[len++] = str[j];

            }
            s[len++] = 1;
        }
        s[len] = 0;
        da(s,sa,Rank,height,len,128);
        int l = 1;
        int ans = 0;
        int r = 10000;
        while(l<=r){
            int mid = (l+r)>>1;
            if(check(mid)){
                ans = mid;
                l = mid+1;
            }
            else{
                r = mid-1;
            }
        }
        printf("%d\n",ans);
    }
}