简略题意:求可重叠的至少出现t次的最长重复子串。
(数值好像很大啊,我们来离散化一下吧)
先二分长度k,随后按照height不小于k分组,若存在一组的个数不小于t即可满足条件。
#include <iostream>
#include <cstring>
#include <map>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
struct SuffixArray{
static const int maxn = 1e6+7;
int s[maxn], n, m;
int sa[maxn], rank[maxn], height[maxn];
int t[maxn], t2[maxn], c[maxn];
int MIN[maxn][30];
void build_sa(){
s[n++] = 0;
int *x = t, *y = t2;
for(int i=0; i<m; i++) c[i] = 0;
for(int i=0; i<n; i++) c[x[i]=s[i]]++;
for(int i=1; i<m; i++) c[i]+=c[i-1];
for(int i=n-1; i>=0; i--) sa[--c[x[i]]] = i;
for(int k=1; k<=n; k<<=1){
int p = 0;
for(int i=n-k; 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-1; i>=0; i--) sa[--c[x[y[i]]]] = y[i];
swap(x, y);
p = 1; x[sa[0]] = 0;
for(int i=1; i<n; i++)
x[sa[i]] = y[sa[i-1]]==y[sa[i]] && y[sa[i-1]+k]==y[sa[i]+k]?p-1:p++;
if(p >= n) break;
m=p;
}
n--;
}
void getheight(){
int k = 0;
for(int i=1; i<=n; i++) rank[sa[i]] = i;
for(int i=0; i<n; i++){
if(k) k --;
int j = sa[rank[i]-1];
while(s[i+k] == s[j+k]) k++;
height[rank[i]] = k;
}
}
void RMQ_init(){
for(int i=0; i<n; i++) MIN[i][0] = height[i+1];
for(int j=1; (1<<j)<=n; j++){
for(int i=0; i+(1<<j)<=n; i++){
MIN[i][j] = min(MIN[i][j-1], MIN[i+(1<<(j-1))][j-1]);
}
}
}
int RMQ(int L, int R){
int k = 0;
while((1<<(k+1)) <= R-L+1) k++;
return min(MIN[L][k], MIN[R-(1<<k)+1][k]);
}
int LCP(int i, int j){
if(rank[i] > rank[j]) swap(i, j);
return RMQ(rank[i], rank[j]-1);
}
void init(int *str, int _n){
m = 20001;
n = _n;
memset(height, 0, sizeof height);
for(int i=0; i<n; i++)
s[i] = (int)str[i];
build_sa();
getheight();
RMQ_init();
}
int check(int x, int k) {
int cnt = 1;
for(int i = 2; i <= n; i++) {
if(height[i] >= x) {
cnt ++;
if(cnt >= k) return 1;
} else {
cnt = 1;
}
}
return cnt >= k;
}
void solve(int k) {
int l = 0, r = n + 1, m;
while(l < r) {
m = (l + r) >> 1;
if(check(m, k)) l = m + 1;
else r = m;
}
printf("%d\n", l - 1);
}
}suffix;
int n, k;
int str[22000];
vector<int> V;
int get(int x) {
return lower_bound(V.begin(), V.end(), x) - V.begin() + 1;
}
int main() {
while(~scanf("%d%d", &n, &k)) {
V.clear();
for(int i = 0; i < n; i++) scanf("%d", str + i), V.push_back(str[i]);
sort(V.begin(), V.end());
V.erase(unique(V.begin(), V.end()), V.end());
for(int i = 0; i < n; i++) str[i] = get(str[i]);
suffix.init(str, n);
suffix.solve(k);
}
return 0;
}