题意:
给出两个长度小于1e6的字符串,问第一字符串的所有字串中有多少个和第二个字符串的后缀相同,输出每个相同的字串的长度和,答案还需要%1e9+7
分析:
把第二个字符串反转后,用KMP预处理,在算出nxt数组之外还需要记录下当前字符匹配后对答案的贡献base,计算的公式为base[i]=base[nxt[i]]+i
代码:
#include<bits/stdc++.h>
#define fi first
#define se second
#define mid (l+r>>1)
#define endl '\n'
#define double long double
using namespace std;
typedef long long ll;
typedef pair<int, int>pii;
typedef vector<int>vi;
struct tri {int a, b, c;};
const int N = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
ll base[N];
char a[N], b[N];
int nxt[N];
ll solve()
{
cin >> a + 1 >> b + 1;
ll ret = 0;
int la = strlen(a + 1), lb = strlen(b + 1);
reverse(a + 1, a + la + 1);
reverse(b + 1, b + lb + 1);
for(int i = 2, j = 0; i <= lb; i++) //j是能和i-1匹配的前缀
{
while(j && b[i] != b[j + 1]) j = nxt[j];
if(b[i] == b[j + 1]) j++;
nxt[i] = j;
base[i] = i + base[nxt[i]];
}
for(int i = 1, j = 0; i <= la; i++)
{
while(j && a[i] != b[j + 1]) j = nxt[j];
if(a[i] == b[j + 1]) ret += base[j++];
if(j == lb)j = nxt[j];
}
return ret % mod;
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0);
base[1] = 1;
int _; cin >> _;
while(_--)
cout << solve() << endl;
return 0;
}