二分长度 然后判断是否出现k次 因为height数组的前缀的公共部分是有连续性的所以扫一遍就行
#include<cstdio>
#include<algorithm>
#include<iostream>
#define maxn 20005
#define maxC 1000005
using namespace std;
int wa[maxn],wb[maxn],wv[maxn],wcnt[maxC];
int sa[maxn],ran[maxn],height[maxn];
int s[maxn],n,k;
int cmp(int *r,int a,int b,int l)
{
return r[a]==r[b]&&r[a+l]==r[b+l];
}
void mda(int *r,int *sa,int n,int m)
{
int i,j,p,*x = wa,*y = wb,*t;
for(i=0;i<m;i++)wcnt[i] = 0;
for(i=0;i<n;i++)wcnt[x[i] = r[i]]++;
for(i=1;i<m;i++)wcnt[i] += wcnt[i-1];
for(i=n-1;i>=0;i--)sa[--wcnt[x[i]]] = i;
for(int 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>=0)y[p++] = sa[i]-j;
for(i=0;i<n;i++)wv[i] = x[y[i]];
for(i=0;i<m;i++)wcnt[i] = 0;
for(i=0;i<n;i++)wcnt[wv[i]]++;
for(i=1;i<m;i++)wcnt[i]+=wcnt[i-1];
for(i=n-1;i>=0;i--)sa[--wcnt[wv[i]]] = y[i];
for(t=x,x=y,y=t,x[sa[0]] = 0,p=1,i=1;i<n;i++)
x[sa[i]] = cmp(y,sa[i-1],sa[i],j)?p-1:p++;
}
}
void getHeight(int *r,int n)
{
int i,j,k = 0;
for(int i=0;i<=n;i++)ran[sa[i]] = i;
for(int i=0;i<n;i++)
{
if(k)k--;
else k = 0;
j = sa[ran[i]-1];
while(r[i+k]==r[j+k])k++;
height[ran[i]] = k;
}
}
bool ok(int hi)
{
int sum = 0,ans = 0;
for(int i=1;i<=n;i++)
{
if(height[i]>=hi){if(!sum)sum++;sum++;}
else sum = 0;
ans = max(ans,sum);
}
if(ans>=k)return true;
else return false;
}
int main()
{
while(scanf("%d%d",&n,&k)!=EOF)
{
int range = 0;
for(int i=0;i<n;i++){scanf("%d",&s[i]);++s[i];range = max(range,s[i]);}
s[n] = 0;
n++;
mda(s,sa,n,range+1);
getHeight(s,n-1);
int l=0,r=n-1,ans = 0;
while(l<=r)
{
int mid = (l+r)/2;
if(ok(mid))
{
ans = mid;
l = mid+1;
}
else r = mid-1;
}
printf("%d\n",ans);
}
return 0;
}