HDU-3336 Count the string

题目链接：https://vjudge.net/problem/HDU-3336

利用扩展kmp的extand数组，extand[i]是几就代表这里有几个前缀匹配，只要都加起来就好，记住取余

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
const int N = 200010;
const int MOD=10007;
int next0[N],extand[N];
void getnext(char *T){// next[i]: 以第i位置开始的子串 与 T的公共前缀 
     int i,length = strlen(T);
     next0[0] = length;
     for(i = 0;i<length-1 && T[i]==T[i+1]; i++);
          next0[1] = i;
          int a = 1;
          for(int k = 2; k < length; k++){
                  int p = a+next0[a]-1, L = next0[k-a];
                  if( (k-1)+L >= p ){
                       int j = (p-k+1)>0? (p-k+1) : 0; 
                       while(k+j<length && T[k+j]==T[j]) j++;// 枚举(p+1，length) 与(p-k+1,length) 区间比较 
                       next0[k] = j, a = k;
                  } 
                  else next0[k] = L;
         } 
}
void getextand(char *S,char *T){
   memset(next0,0,sizeof(next0)); 
         getnext(T); 
         int Slen = strlen(S), Tlen = strlen(T), a = 0;
         int MinLen = Slen>Tlen?Tlen:Slen;
         while(a<MinLen && S[a]==T[a]) a++;
         extand[0] = a, a = 0;
         for(int k = 1; k < Slen; k++){
              int p = a+extand[a]-1, L = next0[k-a];  
              if( (k-1)+L >= p ){
                   int j = (p-k+1)>0? (p-k+1) : 0; 
                   while(k+j<Slen && j<Tlen && S[k+j]==T[j] ) j++; 
                   extand[k] = j;a = k; 
              } 
              else extand[k] = L;         
         }
}
char a[N];
int n;
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		scanf("%s",a);
		getextand(a,a);
		int ans=0,l=strlen(a);
		for(int i=0;i<l;i++)
		ans+=extand[i],ans%=MOD;
		printf("%d\n",ans);
	}
	return 0;
}