bzoj3670: [Noi2014]动物园:https://www.lydsy.com/JudgeOnline/problem.php?id=3670
求p
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char a[1100000];
int lena;
int p[1100000],num[1100000];//num:1~i有多少个符合的前后缀
long long ans;
long long m=1e9+7;
void kmp()
{
p[1]=0;
int j=0,k=0;
for (int i=2;i<=lena;i++)
{
while (j!=0&&a[i]!=a[j+1]) j=p[j];
if(a[i]==a[j+1]) j++;
p[i]=j; num[i]=num[j]+1;
while (k!=0&&a[i]!=a[k+1]) k=p[k];
if (a[i]==a[k+1]) k++;
while (k!=0&&k>(i/2)) k=p[k];
ans=(ans*(num[k]+1))%m;
}
}
int main()
{
int t;
scanf("%d",&t);
while (t--)
{
ans=1;num[1]=1;num[0]=0;
memset(p,0,sizeof(p));
scanf("%s",a+1);
lena=strlen(a+1);
kmp();
printf("%lld\n",(ans+m)%m);
}
return 0;
}