扩展kmp模板

#include <bits/stdc++.h>

using namespace std;
const int N = 1e6+100;
int sum[N];
const int mod = 1e9+7;

char s1[N], s2[N];
int nxt[N], extend[N];
void exkmp(char s1[],char s2[],int next1[],int ex[]) { //计算s1的任意后缀与s2的最长公共前缀，结果存入ex中，从0开始。
    int i,j,p;
    for(i=0,j=0,p=-1;s1[i]!='\0';i++,j++,p--) {
        if(p==-1) {
            j=0;
            do p++;
            while(s1[i+p]!='\0'&&s1[i+p]==s2[j+p]);
            ex[i]=p;
        }
        else if(next1[j]<p) ex[i]=next1[j];
        else if(next1[j]>p) ex[i]=p;
        else {
            j=0;
            while(s1[i+p]!='\0'&&s1[i+p]==s2[j+p]) p++;
            ex[i]=p;
        }
    }
    ex[i]=0;
}
void work() {        //初始化并调用exkmp
    nxt[0]=0;
    exkmp(s2+1,s2,nxt,nxt+1);
    exkmp(s1,s2,nxt,extend);
}
int main() {
    freopen("a.txt","r",stdin);
    ios::sync_with_stdio(0);
    int T;
    cin>>T;
    sum[0] = 0;
    for(int i = 1; i < N; i++) sum[i] = (sum[i-1]+i)%mod;
    while(T--){
        int ans = 0;
        cin>>s1>>s2;
        reverse(s1,s1+strlen(s1));
        reverse(s2,s2+strlen(s2));
        work();
        for(int i = 0; i < strlen(s1); i++) ans = (ans+sum[extend[i]])%mod;
        cout<<ans<<endl;
    }
    return 0;
}