POJ1743 Musical Theme 最长不重叠重复子串

https://vjudge.net/contest/302355#problem/C

二分+后缀数组

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<vector> 
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a));
#define lowbit(x)  x&-x;  
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int maxn = 1e6+100;
int s1[maxn],s2[maxn];
int sa[maxn];
int c[maxn];
int x[maxn],y[maxn],rk[maxn],h[maxn];
int n,m,K;
void get_SA(){
	mem(c,0);
	for(int i = 0; i <= n; i++) ++c[x[i] = s1[i]];
	for(int i = 1; i <= m; i++) c[i] += c[i-1];
	for(int i = n; i >= 0; i--) sa[--c[x[i]]] = i;
	for(int k = 1; k <= n+1; k <<= 1){
		int p = 0;
		for(int i = n-k+1; i <= n; i++) y[p++] = i;
		for(int i = 0; i <= n; i++)
			if(sa[i] >= k) y[p++] = sa[i]-k;
		for(int i = 0; i <= m; i++) c[i] = 0;
		for(int i = 0; i <= n; i++) c[x[y[i]]]++;
		for(int i = 1; i <= m; i++) c[i] += c[i-1];
		for(int i = n; i >= 0; i--){
			sa[--c[x[y[i]]]] = y[i];
		}
		swap(x,y);
		x[sa[0]] = 0;
		p = 1;
		for(int i = 1; i <= n; i++){
			x[sa[i]] = (y[sa[i]] == y[sa[i-1]] && y[sa[i]+k] == y[sa[i-1]+k])?p-1:p++;
		}
		if(p >= n) break;
		m = p;
	}
}
void get_Height(){
	int k = 0;
	for(int i = 0; i <= n; i++) rk[sa[i]] = i;
	for(int i = 0; i < n; i++){
		if(k) k--;
		int j = sa[rk[i]-1];
		while(s1[i+k] == s1[j+k]) k++;
		h[rk[i]] = k;
	}
}
bool check(int xx){
	int mxx = 0,minn = inf;
	for(int i = 2; i <= n; i++){
		if(h[i] >= xx){
			mxx = max(mxx,max(sa[i],sa[i-1]));
			minn = min(minn,min(sa[i],sa[i-1]));
			if(mxx - minn > xx) return true;
		}else{
			mxx = 0,minn = inf;
		}
	}
	return false;
}
int main(){
	while(~scanf("%d",&n)&&n){
		for(int i = 0; i < n; i++){
			scanf("%d",&s2[i]);
		}
		for(int i = 0; i < n; i++){
			s1[i] = s2[i]-s2[i-1]+90; //防止复数 
		}
		m = 190; 
		get_SA();
		get_Height();
		int ans = 0;
		int l = 0, r = n;
		while(l <= r){
			int mid = (l+r)>>1;
			if(check(mid)){
				ans = mid;
				l = mid+1;
			}else
				r = mid-1;
		}
		if(ans >= 4)
			printf("%d\n",ans+1);
		else
			printf("0\n");
	}
	return 0;
}