题目:
http://acm.hdu.edu.cn/showproblem.php?pid=6153
题意:给你串s,串p,求∑(p的后缀在s中出现的次数*长度)
题意:给你串s,串p,求∑(p的后缀在s中出现的次数*长度)
思路:将串都反转后,转化为求前缀,可利用kmp求解
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MOD = 1e9+7;
const int N = 1e6+5;
char s[N],p[N];
int Next[N];
long long num[N];
void Getfail(int m)
{
Next[0]=-1;
int i=0,j=-1;
while(i<m)
{
if(j==-1||p[i]==p[j])//匹配
{
i++,j++;
Next[i]=j;
}
else
j=Next[j];
}
}
int KMP(int n,int m)
{
int i=0,j=0;//,ans=0;
while(i<n)
{
if(j==-1 || s[i]==p[j])
i++,j++;
else
j = Next[j];
num[j]++;
if(j==m)
{
//ans++;
j=Next[j];
}
}
//return ans;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(num,0,sizeof(num));
scanf("%s",s);
scanf("%s",p);
int n = strlen(s);
int m = strlen(p);
reverse(s,s + n);
reverse(p,p + m);
Getfail(m);
KMP(n,m);
long long sum = 0;
for(int i = m;i >= 1;i--)
{
num[Next[i]] += num[i];
sum = (sum + num[i]*i%MOD)%MOD;
}
printf("%lld\n",sum);
}
return 0;
}