文章目录
KMP及AC自动机练习题
前导知识
:
AC自动机板块代码未给出
1. 【模板】KMP字符串匹配
#include <iostream>
#include <cstring>
#define MAX_N 1000010
using namespace std;
int len1,len2;
char s1[MAX_N],s2[MAX_N];
int pi[MAX_N];
void prefix_function(){
int t1=0,t2;
pi[0]=t2=-1;
while(t1<len2){
if(t2==-1||s2[t1]==s2[t2])
pi[++t1]=++t2;
else
t2=pi[t2];
}
}
void KMP(){
int t1=0,t2=0;
while(t1<len1){
if(t2==-1||s1[t1]==s2[t2]){
t1++,t2++;
}
else t2=pi[t2];
if(t2==len2){
printf("%d\n",t1-len2+1);
t2=pi[t2];
}
}
}
int main(){
scanf("%s",s1);
scanf("%s",s2);
len1=strlen(s1);
len2=strlen(s2);
prefix_function();
KMP();
for(int i=1;i<=len2;i++){
cout<<pi[i]<<" ";
}
return 0;
}
2. [POI2006]OKR-Periods of Words
#include <cstdio>
#include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
const int MAX_N = 1000010;
char s[MAX_N];
int fail[MAX_N],n;
int main(){
scanf("%d",&n);
scanf("%s",s);
int i,j;
ll cnt=0;
fail[0]=fail[1]=0;j=0;
for(i=1;i<n;i++){
while(j && s[i]!=s[j]) j=fail[j];
j+=(s[i]==s[j]);
fail[i+1]=j;
}
for(i=1;i<=n;i++){
j=i;
while(fail[j]) j=fail[j];
if(fail[i]!=0) fail[i]=j;
cnt+=i-j;
}
printf("%lld\n",cnt);
return 0;
}