题目
求字符串 S S S的每个前缀 B i B_i Bi的可以成为后缀的前缀的总长度
分析
利用fail可知 S [ 1... f a i l [ i ] ] = S [ i − f a i l [ i ] + 1... i ] S[1...fail[i]]=S[i-fail[i]+1...i] S[1...fail[i]]=S[i−fail[i]+1...i],所以如果答案就是i-fail[i],为了优化,实时更新fail的值
代码
#include <cstdio>
using namespace std;
char s[1000001]; int n,fail[1000001],j;
int in(){
int ans=0; char c=getchar();
while (c<48||c>57) c=getchar();
while (c>47&&c<58) ans=ans*10+c-48,c=getchar();
return ans;
}
int main(){
n=in(); long long ans=0;
for (int i=1;i<=n;i++) s[i]=getchar();
fail[1]=j=0;
for (int i=2;i<=n;i++){//求fail数组
while (j&&s[i]!=s[j+1]) j=fail[j];
fail[i]=(j+=(s[i]==s[j+1]));
}
for (int i=2;i<=n;i++){
j=i;
while (fail[j]) j=fail[j];
if (fail[i]) fail[i]=j;
ans+=i-j;
}
return !printf("%lld",ans);
}