HDU 3336 解题报告

Count the string

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

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
  
  
  
  

   
   思路：
  
  
  
  

   
   1、首先确定下这个字符串的首个字母，然后从第二个开始搜起
  
  
  
  

   
   当遇到和首字符一样的时候，就从该字母开始和这个字符串的首
  
  
  
  

   
   个
   
   字符开始进行比较，知道出现不一样为止，此时相同的个数就
  
  
  
  

   
   加到总数上。
  
  
  
  

   
   2、不一样的话就从和首个字符一样的位置的下一个字符开始。
  
  
  
  

   
   然后和1步骤差不多，就是这个字符和首个字符往后走，遇到不
  
  
  
  

   
   一样又重复这个步骤。。。
  
  
  
  

   
   
  
  
  
  

   
   代码如下：
  
  
  
  

   
   #include <stdio.h>
char str[200005];
int main()
{
    int t,n,i,j,sum;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        sum=n;
        sum%=10007;
        scanf("%s",str);
        for(i=1;i<n;i++)
        {
            if(str[i]==str[0])
            {
                for(j=i;j<n;j++)
                {
                    if(str[j]!=str[j-i])
                        break;
                }
                sum+=j-i;
                sum%=10007;
            }
        }
        printf("%d/n",sum);
    }
    return 0;
}