继续练习后缀数组的题目,这次也是比较经典的题型,求出来的重复k次的子串可以重叠,求height数组之后,计算连续的一片区域使得height[i]都大于k
再记录几个易错点:
1、在原始的数组后面要补充一个数字0,不然的话计算后缀数组的时候会出现问题,同时数组长度会变成n+1,因此在计算后缀数组的时候参数输入的时候要注意+1;
2、在check函数当中,发现第一个大于k的height[i]时,计数器的值应该直接变为1,因为height[i]求的是sa[i]和sa[i-1]的公共前缀,也就意味着已经有两个满足要求的子串,这里下次应该注意。
#include<cstdio>
#include<memory.h>
#include<cstring>
using namespace std;
#define maxn 20050
#define maxm 1000050
int wa[maxm]={0}, wb[maxm]={0}, wv[maxm]={0}, ws[maxm]={0};
int rank[maxn]={0}, sa[maxn]={0}, height[maxn]={0};
int milk[maxn]={0};
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++;
}
}
//计算height数组模板
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++);
}
bool check(int mid,int n,int k){
int i=0;
int cnt = 0;
while(true){
while(i<=n&&height[i]<mid)
i++;
if(i>n)
break;
cnt = 1;
while(i<=n&&height[i]>=mid){
cnt++;
i++;
}
//printf("cnt: %d\n",cnt);
if(cnt>=k)
return true;
}
return false;
}
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i=0;i<n;++i){
scanf("%d",&milk[i]);
}
DA(milk,sa,n+1,maxm);
calheight(milk,sa,n);
/*for(int i=0;i<n+2;++i)
printf("%d ",height[i]);
printf("\n");*/
int left = 0,right = n;
while(left<right){
//printf("left: %d right: %d\n",left,right);
int mid = (left+right+1)>>1;
if(check(mid,n,k)){
left = mid;
}
else
right = mid - 1;
}
printf("%d\n",left);
//getchar();
//getchar();
return 0;
}