自己弱智了,看了一晚上题解没看懂,可能脑子糊涂了吧。
先在处理next[]的时候处理num[],此时的含义表示失配多少次能到达-1,(也就是有多少相同的前后缀,只是有前后缀是重叠的),
那么再跑一次next[],这里就往回跑j = next[j],直到前缀长度S*2 <= i,此时的num[]即是要求的num。
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <bitset>
#define mod 1000000007
#define INF 0x3f3f3f3f
#define fuck() (cout << "----------------------------------------" << endl)
const int maxn = 1000000 + 5;
using namespace std;
long long NEXT[maxn];
long long num[maxn];
void getNext(string str){
NEXT[0] = -1;
long long j = -1;
long long i = 0;
num[0] = 0;
long long len = (long long)str.size();
while(i != len){
if(j == -1 || str[i] == str[j]){
NEXT[++i] = ++j;
num[i] = num[j] + 1;
}
else j = NEXT[j];
}
}
void getAns(string str){
long long ans = 1;
long long i = 0;
long long j = -1;
long long len = (long long )str.size();
while(i != len){
if(j == -1 || str[i] == str[j]){
i++;
j++;
while(j != -1 && (j << 1) > i){
j = NEXT[j];
}
ans = ans * (num[j] + 1) % mod;
}
else j = NEXT[j];
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
int n;
cin >> n;
while(n--){
memset(num, 0, sizeof(num));
string x;
cin >> x;
getNext(x);
getAns(x);
}
}