套了拓展KMP的模板,还没有完全理解模板的意思,所以用这一题试了试模板。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
//inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=x&(-x);return res;}
//inline void add(int x,int d){while(x<=n)c[x]+=d,x+=x&(-x);}
//int gcd(int a, int b) { return b == 0 ? a : gcd(b, a%b);}
const ll inf = 0x3f3f3f3f;
const int mx = 1e6+11;
const int mod = 1e9+7;
int mynext[mx],extend[mx];
char T[mx],S[mx];
void Getmynext()
{
int t_len = strlen(T);
mynext[0] = t_len;
int a;
int p;
for (int i = 1, j = -1; i < t_len; i++, j--)
{
if (j < 0 || i + mynext[i - a] >= p)
{
if (j < 0)
p = i, j = 0;
while (p < t_len&&T[p] == T[j])
p++, j++;
mynext[i] = j;
a = i;
}
else
mynext[i] = mynext[i - a];
}
}
/* 求解extend[] */
void GetExtend()
{
Getmynext(); //得到mynext
int a;
int p; //记录匹配成功的字符的最远位置p,及起始位置a
int s_len =strlen(S);
int t_len = strlen(T);
for (int i = 0, j = -1; i < s_len; i++, j--) //j即等于p与i的距离,其作用是判断i是否大于p(如果j<0,则i大于p)
{
if (j < 0 || i + mynext[i - a] >= p) //i大于p(其实j最小只可以到-1,j<0的写法方便读者理解程序),
{ //或者可以继续比较(之所以使用大于等于而不用等于也是为了方便读者理解程序)
if (j < 0)
p = i, j = 0; //如果i大于p
while (p < s_len&&j < t_len&&S[p] == T[j])
p++, j++;
extend[i] = j;
a = i;
}
else
extend[i] = mynext[i - a];
}
}
int main(){
// freopen("F:\\in.txt","r",stdin);
int ca=10; scanf("%d",&ca);
while(ca--){
mem(extend,0);
mem(mynext,0);
scanf("%s %s",S,T);
int slen = strlen(S),tlen=strlen(T);
reverse(S,S+slen);
reverse(T,T+tlen);
GetExtend();
int ans = 0;
for(int i = 0; i < slen; i++){
if(extend[i]){
ans += 1LL*(extend[i]+1)*extend[i]/2%mod;
if(ans >= mod)
ans -= mod;
}
}
printf("%d\n",ans);
}
return 0;
}