hdu 3336 Count the string（KMP+dp）

                                                  Count the string

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

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

题解:灵活运用KMP的next数组，这里next数组保存以s【i】结尾的最长前缀长度，设dp【i】的值代表0~i的字符中的前缀数，显然0~i的字符的前缀数等于以是s【i】结尾的最长前缀的dp值+1（0~i这个个前缀），这里代码中的表示的长度和下标灵活使用- -比较容易混淆，看多几遍就会懂了....

#include <stdio.h>
#include <string.h>
int next[200005],dp[200005],l;
char s[200005];
void get_next()
{
    int i,temp;

    memset(next,0,sizeof(next));
    for(i=1;i<l;i++)
    {
        temp=next[i-1];
        while(temp&&s[temp]!=s[i])
            temp=next[temp-1];
        if(s[temp]==s[i]) next[i]=temp+1;
        else next[i]=0;
    }
}
int solve()
{
    int i,sum=0;

    get_next();
    for(i=0;i<l;i++) dp[i]=1;
    printf("\n");
    for(i=0;i<l;i++)
    {
        if(next[i]) dp[i]+=dp[next[i]-1];
        sum+=dp[i];
    }

    return sum%10007;
}
int main()
{
    int t;

    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%s",&l,s);
        printf("%d\n",solve());
    }

    return 0;
}