题目链接:点击这里
题目大意:
给定一个长度为
n
n
n 的序列
a
[
i
]
a[i]
a[i] ,求至少重复
k
k
k 次的重复子串的最长长度
题目分析:
答案具有单调性是显然的,考虑如何写
check(x)
\text{check(x)}
check(x) ,我们可以先对序列哈希一下,然后对于每一个长度为
x
x
x 的字串的哈希值都存到一个计数桶里(这里用的
m
a
p
map
map 当桶),最后扫一遍桶,看是否有次数大于等于
k
k
k 次的哈希值即可判段当前长度是否合法
时间复杂度为
O
(
n
l
o
g
2
n
)
O(nlog^2n)
O(nlog2n)
具体细节见代码:
// Powered by CP Editor (https://cpeditor.org)
#pragma GCC optimize(2)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<unordered_map>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
#define int ll
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int read()
{
int res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 1e6+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
const int p[] = {1000000007,1000000009};
const int base[] = {233,2333};
int n,k,a[maxn],Hash[2][maxn],f[2][maxn];
void init(int n)
{
f[0][0] = f[1][0] = 1;
for(int j = 0;j < 2;j++)
for(int i = 1;i <= n;i++) f[j][i] = f[j][i-1]*base[j]%p[j];
for(int j = 0;j < 2;j++)
for(int i = 1;i <= n;i++) Hash[j][i] = (Hash[j][i-1]*base[j]+a[i])%p[j];
}
pair<int,int> get_Hash(int l,int r)
{
return make_pair((Hash[0][r]-Hash[0][l-1]*f[0][r-l+1]%p[0]+p[0])%p[0],
(Hash[1][r]-Hash[1][l-1]*f[1][r-l+1]%p[1]+p[1])%p[1]);
}
map<pair<int,int>,int>mp;
bool check(int x)
{
mp.clear();
for(int i = 1;i+x-1 <= n;i++) mp[get_Hash(i,i+x-1)]++;
for(auto it:mp) if(it.second >= k) return true;
return false;
}
signed main()
{
n = read(),k = read();
for(int i = 1;i <= n;i++) a[i] = read();
init(n);
int l = 1,r = n,res = n;
while(l <= r)
{
int mid = l+r>>1;
if(check(mid)) res = mid,l = mid+1;
else r = mid-1;
}
cout<<res<<endl;
return 0;
}