题目:https://codeforces.com/gym/307723/problem/C
题意:给出一个字符串S,要求找出两个子串A和B,A和B等长,S可以表示成 A A A A ⋅ ⋅ ⋅ A ⏟ n B B ⋅ ⋅ ⋅ B ⏟ m A A A A A ⋅ ⋅ ⋅ A ⏟ k a \underbrace{AAAA···A}_n\underbrace{BB···B}_m\underbrace{AAAAA···A}_ka n AAAA⋅⋅⋅Am BB⋅⋅⋅Bk AAAAA⋅⋅⋅Aa,其中a是A的前缀,a的长度大于等于0并且小于A的长度, n , m , k > 0 n,m,k>0 n,m,k>0。
思路:处理S的哈希值,然后枚举A和B的长度len,判断是否满足条件,每次跳过len个长度的串,复杂度 ∑ i = 1 n n i \sum_{i=1}^n\dfrac{n}{i} ∑i=1nin大约是 n l o g ( n ) nlog(n) nlog(n)
代码:
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define lowbit(x) x&(-x)
#define pb push_back
#define MAXN 800010
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<double,int>P;
char s[MAXN];
ull xp[MAXN],hash1[MAXN];
const int base=37;
void init()
{
xp[0]=1;
for(int i=1;i<MAXN;i++)xp[i]=xp[i-1]*base;
}
ull get_hash(int l,int r)
{
return hash1[r]-hash1[l-1]*xp[r-l+1];
}
int main(){
init();
scanf("%s",s+1);
int n=strlen(s+1);
for(int i=1;i<=n;i++)hash1[i]=hash1[i-1]*base+s[i]-'a';
for(int i=1;i<=n/3;i++)
{
ull a=get_hash(1,i),b;
int f1=0,f2=0,flag=1,b_site,j;
for(j=i+1;j+i-1<=n;j+=i)
{
ull tmp=get_hash(j,j+i-1);
if(tmp!=a&&f1==0)f1=1,b=tmp,b_site=j;
if(tmp==a&&f1&&!f2)f2=1;
if((f2&&tmp!=a)||(!f2&&f1&&tmp!=b))
{
flag=0;break;
}
}
if(flag)
{
for(int k=j,p=1;k<=n;k++,p++)
{
if(s[k]!=s[p])
{
flag=0;break;
}
}
}
if(flag)
{
for(int k=1;k<=i;k++)printf("%c",s[k]);
printf(" ");
for(int k=b_site;k<b_site+i;k++)printf("%c",s[k]);
break;
}
}
return 0;
}