【POJ3261】后缀数组+二分答案

【POJ3261】

题目大意

---

• 给出⼀个长度为n的串，字符集大小为10^6。计算出现了至少k次的最长子串长度
• n<=2*10^4 , 2<=k<=n

分析

---

• 二分答案
• 将height<=mid的位置断开，判断是否存在⼀个长度k的连续的段即可

Code

---

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=1e5+100;
int height[N],s[N],bin[N],tmp[N],sa[N],rk[N],h[N],ans=0,n,k;
char x;
void SA(){
	int sz=max(n,300);
	rep(i, 0,   n-1 )	rk[i]=s[i];
	rep(i, 0,   n-1 ) 	++bin[rk[i]];
	rep(i, 1,   sz-1)	bin[i]+=bin[i-1];
	rep(i, 0, n-1  ) 	sa[--bin[rk[i]]]=i;
	for(int j=1;j<=n;j*=2)
	{
		int p=0;
		per(i,	n-1, n-j )   tmp[p++]=i;
		rep(i,	0,	 n-1 )	 if(sa[i]-j>=0)tmp[p++]=sa[i]-j;//Attention
		rep(i,	0,	 sz-1) 	 bin[i]=0;
		rep(i,	0,	 n-1 )   ++bin[rk[i]];
		rep(i,	1,	 sz-1) 	 bin[i]+=bin[i-1];
		per(i,	n-1, 0   ) 	 sa[--bin[rk[tmp[i]]]]=tmp[i];//Attention
		p=tmp[sa[0]]=0;
		rep(i,1,n-1){
			int v0=sa[i-1],v1=sa[i],v00,v01;
			if (v0 + j < n) v00 = rk[v0 + j]; else v00 = -1 ;//Attention
        	        if (v1 + j < n) v01 = rk[v1 + j]; else v01 = -1 ;//Attention
			if(rk[v0]==rk[v1] && v00==v01) tmp[v1]=p;//Attention
			else tmp[v1]=++p;
		}
		rep( i, 0, n-1  )    rk[i]=tmp[i];
	}
}
int getheight() {
    int k=0;
    rep(i,0,n-1) rk[sa[i]]=i;
    rep(i,0,n-1) {
        if (rk[i]==0) continue;
        if (k) --k;
        int j=sa[rk[i]-1];
        while (j+k<n && i+k<n && s[i+k]==s[j+k]) ++k;
        h[i]=height[rk[i]]=k;
    }
}
bool judge(int mid){
	int tot=1;
	rep(i,1,n-1){
		if(height[i]<mid){tot=1;continue;}
		tot++;
		if(tot>=k)return 1;
	}return 0;
}
int main()
{
	scanf("%d%d",&n,&k);
	rep(i,0,n-1)cin>>s[i];
	SA(); getheight();
	int l=1,r=n,mid;
	while(l<=r){
		mid=(l+r)/2;
		if(judge(mid))ans=mid,l=mid+1;
		else r=mid-1;
	}
	cout<<ans;
	return 0;
}