It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example:
s: “abab”
The prefixes are: “a”, “ab”, “aba”, “abab”
For each prefix, we can count the times it matches in s. So we can see that prefix “a” matches twice, “ab” matches twice too, “aba” matches once, and “abab” matches once. Now you are asked to calculate the sum of the match times for all the prefixes. For “abab”, it is 2 + 2 + 1 + 1 = 6.
The answer may be very large, so output the answer mod 10007.
Input
The first line is a single integer T, indicating the number of test cases.
For each case, the first line is an integer n (1 <= n <= 200000), which is the length of string s. A line follows giving the string s. The characters in the strings are all lower-case letters.
Output
For each case, output only one number: the sum of the match times for all the prefixes of s mod 10007.
Sample Input
1
4
abab
Sample Output
6
题意:s串的前缀匹配在s串中出现的次数之和。
f数组的性质:当前位置的最长前后缀相同的长度。
//可以利用f数组的性质,求得是0-i的最大前缀和后缀的匹配,非零的情况就是匹配了一次,然后遍历一下,再加一下所有n个前缀
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
const int MOD=10007;
int res;
int n;
char s[N];
int f[N];
void init()
{
for(int i=2,j=0;i<=n;i++)
{
while(j&&s[i]!=s[j+1]) j=f[j];
if(s[i]==s[j+1]) j++;
f[i]=j;
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>n>>(s+1);
init();
res=n;
for(int i=1;i<=n;i++) if(f[i]>0) res=(res+1)%MOD;
cout<<res<<endl;
}
}