TLE 求助

#include<iostream>
#include<cstdio>
#include<cstring>
#define maxn 1000005
#define mod 1000000007
#define ll long long
#define next nnext
using namespace std;
int T;
ll n,j,next[maxn],num[maxn],ans=1;
char a[maxn];
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%s",a+1); n=strlen(a+1);
		next[1]=0;num[1]=1;
		for(int i=2;i<=n;i++){
			j=next[i-1];
			while(j>=1&&a[j+1]!=a[i]) j=next[j];
			if(a[j+1]==a[i]) next[i]=j+1;
			num[i]=num[next[i]]+1;
		}
		for(int i=2,j=0;i<=n;i++){
			//while(j>=1&&a[j+1]!=a[i]) j=next[j];
			//if(a[j+1]==a[i]) j++;
			while(j>=1&&(j*2)>i) j=next[j];
			ans=(ans*(num[j]+1)%mod);
		}
		printf("%lld\n",ans);
		for(int i=1;i<=n;i++) {a[i]='\000';next[i]=0;num[1]=0;} ans=1;
	}
	return 0;
}