HDOJ3336 KMP简单应用+模板程序

Count the string

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11181 Accepted Submission(s): 5210

Problem Description
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

Author
foreverlin@HNU

Source
HDOJ Monthly Contest – 2010.03.06

Recommend
lcy | We have carefully selected several similar problems for you: 1711 1686 3746 1358 3341

#include <iostream>#include <cstdio>#include <cstring>#define LL long longusing namespace std;const int mod = 10007;const int maxn = 2e5+5;int i,j,k,n;int nex[maxn];LL p[maxn];char s[maxn];void make_text(){    nex[1] = nex[0] = 0;    for (i=1; i<n; i++) {        k=nex[i];        while (k && s[i]!=s[k]) k = nex[k];        nex[i+1] = s[i]==s[k]?k+1:0;    }}int main(){    int T;    scanf("%d",&T);    while (T--) {        scanf("%d",&n);        scanf("%s",s);        make_text();        LL ans = 0;        p[0]=0;        for (i=1; i<=n; i++) {            p[i] = p[nex[i]]+1;            ans = (ans+p[i])%mod;        }        printf("%lld\n",ans);    }    return 0;}