hdu3336（Count the string）KMP的应用

/******************************************************
* author:xiefubao
*******************************************************/
#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <string.h>
//freopen ("in.txt" , "r" , stdin);
using namespace std;

#define eps 1e-8
const double pi=acos(-1.0);
typedef long long LL;
const int Max=200100;
const int INF=10007;
int Next[Max];
int num[Max];
char s[Max];
int len=0;
void get_next()
{
int i=0;
int j=Next[0]=-1;
while(i<len)
{
while(j!=-1&&s[i]!=s[j]) j=Next[j];
Next[++i]=++j;
}
}
int main()
{
int t;cin>>t;
while(t--)
{
//memset(num,0,sizeof num);
scanf("%d",&len);
scanf("%s",s);
get_next();
for(int i=0;i<=len;i++)
{
num[i]=1;
int t=Next[i];
while(t>0)
{
num[t-1]=(num[t-1]+1)%INF;
t=Next[t];
}
}
int ans=0;
for(int i=0;i<len;i++)
{
ans=(ans+num[i])%INF;
}
printf("%d\n",ans);
}
return 0;
}