BZOJ4698 差分 + 二分 + SA

https://www.lydsy.com/JudgeOnline/problem.php?id=4698

题意：求N个字符串中最长的相同字串的长度，相同的定义是：两个子串长度相同且一个串的全部元素加上一个数就会变成另一个串。

这题的难点在于相同的定义，在这样的定义下一般的字符串匹配算法就不适用了。

但是可以通过一个操作，将前后相邻的字符串差分形成一个长度为len - 1的差分串，原来的相同下的定义就转为了差分串的完全相同，证明显然。

在这种情况下，再把字符串全部拼接起来，用特殊字符隔开，然后二分他们的长度去做后缀数组，看有没有相邻的一个区间同时满足长度最大并且包含所有K个字符串。

#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define For(i, x, y) for(int i=x;i<=y;i++)
#define _For(i, x, y) for(int i=x;i>=y;i--)
#define Mem(f, x) memset(f,x,sizeof(f))
#define Sca(x) scanf("%d", &x)
#define Sca2(x,y) scanf("%d%d",&x,&y)
#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define Scl(x) scanf("%lld",&x);
#define Pri(x) printf("%d\n", x)
#define Prl(x) printf("%lld\n",x);
#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define PII pair<int,int>
#define PIL pair<int,long long>
#define PLL pair<long long,long long>
#define pb push_back
#define fi first
#define se second
typedef vector<int> VI;
int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}
while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}
const double eps = 1e-;
const int maxn = 1e6 + ;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + ;
int N,M,K;
int str[maxn],id[maxn];
int a[maxn],Height[maxn];
int tax[maxn],tp[maxn],sa[maxn],rak[maxn];
void Qsort(){
    for(int i = ; i <= M; i ++) tax[i] = ;
    for(int i = ; i <= N ; i ++) tax[rak[i]]++;
    for(int i = ; i <= M ; i ++) tax[i] += tax[i - ];
    for(int i = N; i >=  ; i --) sa[tax[rak[tp[i]]]--] = tp[i];
}
void SA(){
    for(int i = ; i <= N; i ++) rak[i] = str[i],tp[i] = i;
    Qsort();
    for(int w = ,p = ; p < N;w <<= , M = p){
        p = ;
        for(int i = ; i <= w; i ++) tp[++p] = N - w + i;
        for(int i = ; i <= N ; i ++) if(sa[i] > w) tp[++p] = sa[i] - w;
        Qsort(); swap(tp,rak);
        rak[sa[]] = p = ;
        for(int i = ; i <= N ; i ++){
            rak[sa[i]] = (tp[sa[i]] == tp[sa[i - ]] && tp[sa[i] + w] == tp[sa[i - ] + w])?p:++p;
        }
    }
}
void Get_Height(){
    int k = ,j;
    for(int i = ; i <= N; i ++){
        if(k) k --;
        int j = sa[rak[i] - ];
        while(str[j + k] == str[i + k]) k++;
        Height[rak[i]] = k;
    }
}
int Stack[maxn];
bool vis[maxn];
bool check(int x){
    int top = ;
    int num = K;
    for(int i = ; i <= K; i ++) vis[i] = ;
    for(int i = ; i <= N ; i ++){
        if(Height[i] >= x){
            if(!vis[id[sa[i]]]){
                vis[id[sa[i]]] = ;
                Stack[++top] = id[sa[i]];
                num--;
            }
            if(!vis[id[sa[i - ]]]){
                vis[id[sa[i - ]]] = ;
                Stack[++top] = id[sa[i - ]];
                num--;
            }
            if(!num) return true;
        }else{
            for(int j = ; j <= top; j ++) vis[Stack[j]] = ;
            top = ;
            num = K;
        }
    }
    return false;
}
int solve(){
    int l = ,r = N - ;
    int ans = ;
    while(l <= r){
        int m = l + r >> ;
        if(check(m)){
            ans = m;
            l = m + ;
        }else{
            r = m - ;
        }
    }
    return ans + ;
}
int main(){
    Sca(K); N = ;
    M = ;
    int MIN = INF;
    for(int i = ; i <= K ; i ++){
        int x = read();
        a[] = read();
        for(int j = ; j <= x; j ++){
            a[j] = read();
            str[++N] = a[j] - a[j - ];
            MIN = min(MIN,a[j] - a[j - ]);
            id[N] = i;
        }
        str[++N] = ++M; id[N] = i;
    }
    if(MIN <= ){
        MIN = -MIN + ;
        for(int i = ; i <= N ; i ++) str[i] += MIN;
        M += MIN;
    }
    SA(); Get_Height();
    Pri(solve());
    return ;
}