不可重叠子串后缀数组求解，采用二分匹配

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<time.h>
#include<cmath>
using namespace std;
#define INF (1<<30)
typedef long long int LL;
const int MAXN = 300000 + 5;
int wa[MAXN], wb[MAXN], wv[MAXN], WS[MAXN];
int cmp(int *r, int a, int b, int l){
    return r[a] == r[b] && r[a + l] == r[b + l];
}
void da(int *r, int *sa, int n, int m){
    int i, j, p, *x = wa, *y = wb, *t;
    for (i = 0; i<m; i++) WS[i] = 0;
    for (i = 0; i<n; i++) WS[x[i] = r[i]]++;
    for (i = 1; i<m; i++) WS[i] += WS[i - 1];
    for (i = n - 1; i >= 0; i--) sa[--WS[x[i]]] = i;
    for (j = 1, p = 1; p<n; j *= 2, m = p)
    {
        for (p = 0, 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<n; i++) wv[i] = x[y[i]];
        for (i = 0; i<m; i++) WS[i] = 0;
        for (i = 0; i<n; i++) WS[wv[i]]++;
        for (i = 1; i<m; i++) WS[i] += WS[i - 1];
        for (i = n - 1; i >= 0; i--) sa[--WS[wv[i]]] = y[i];
        for (t = x, x = y, y = t, p = 1, x[sa[0]] = 0, i = 1; i<n; i++)
            x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;
    }
    return;
}
int Rank[MAXN], height[MAXN],sa[MAXN];
void calheight(int *r, int *sa, int n){
    int i, j, k = 0;
    for (i = 1; i <= n; i++) Rank[sa[i]] = i;
    for (i = 0; i<n; height[Rank[i++]] = k)
        for (k ? k-- : 0, j = sa[Rank[i] - 1]; r[i + k] == r[j + k]; k++);
    return;
}

int str[22222];
int n;
bool isok(int k){
    bool flag=0;
    int mx=-INF,mm=INF;
    for(int i=1; i<n; ++i){
        if(height[i]>=k){
            mm=min(mm,min(sa[i],sa[i-1]));
            mx=max(mx,max(sa[i],sa[i-1]));
            if(mx-mm>k) return 1;
        }else{
            mx=-INF,mm=INF;
        }
    }
    return 0;
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        for(int i=0;i<n;i++) scanf("%d",&str[i]);
        for(int i=0; i<n-1; ++i) str[i]=str[i+1]-str[i]+88;
        str[n-1]=0;
        da(str,sa,n,200);
        calheight(str,sa,n-1);
        int l=0,r=n>>1;
        while(l<r){
            int mid=l+r+1>>1;
            if(isok(mid)) l=mid;
            else r=mid-1;
        }
        if(l>=4) printf("%d\n",l+1);
        else printf("%d\n",0);
    }
    return 0;
}