HDU 3336 Count the string kmp

一、内容

 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

二、思路

• next求出的就是和前缀匹配的最大长度，若长度大于0代表和前缀匹配，那么个数增加1，然后缩小前缀再进行判断
• 如 ababa 当我们匹配到a的时候，得到的next[5] = 3, 这时候次数增加1， 再匹配一下next[3] = 1,值也大于0那么次数还要增加， 再匹配next[1] = 0, 等于0了代表没有前缀和它相等了。

三、代码

#include <cstdio>
#include <cstring>
using namespace std;
const int N = 2e5 + 5;
int t, n, ne[N];
char s[N];
int getNext() {
	ne[1] = 0; 
	int ans = n;
	for (int i = 2, j = 0; i <= n; i++) {
		while (j && s[i] != s[j + 1]) j = ne[j];
		if (s[i] == s[j + 1]) j++;
		ne[i] = j; 
		int t = j;
		while (t) {	ans++; t = ne[t];}
		ans %= 10007;
	}
	return ans;
}
int main() {
	scanf("%d", &t);
	while (t--) {
		scanf("%d%s", &n, s + 1);
		printf("%d\n", getNext());
	}
	return 0;
}