HDU 3336 Count the string(KMP+求给定字符串含前缀的数量)
来源:互联网 发布:java新手入门教程视频 编辑:程序博客网 时间:2024/06/02 01:56
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9931 Accepted Submission(s): 4643
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.
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.
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
14abab
Sample Output
6
Author
foreverlin@HNU
Source
HDOJ Monthly Contest – 2010.03.06
Recommend
lcy | We have carefully selected several similar problems for you: 1686 1358 3341 2222 3068
#include<stdio.h>#include<string.h>int n,m;char b[200010];int p[200010];//生成匹配表 void get_p(){p[1] = 0;int i,j = 0;for(i = 2; i <= m; i++){while(j > 0 && b[j+1] != b[i]){j = p[j];}if(b[j+1] == b[i]){j += 1;}p[i] = j;}}int dp[2000010];int main(){int t,i;scanf("%d",&t);while(t--){scanf("%d",&m);scanf("%s",b+1);get_p();dp[0] = 0;int sum = 0;for(i = 1; i <= m; i++){dp[i] = dp[p[i]] + 1; //含前缀的数量 sum = (sum+dp[i])%10007; //注意输出格式 }printf("%d\n",sum);}}//示例解析:a b a b0 0 1 1 m+1+1=6 注意循环的使用
0 0
- HDU 3336 Count the string(KMP+求给定字符串含前缀的数量)
- Hdu 3336 Count the string(求给定字符串含前缀的数量)
- hdu 3336Count the string(KMP变形,求前缀出现的次数和)
- hdoj 3336 Count the string 【kmp求 所有前缀 在原串中出现的次数 总和】
- 所有前缀在串中出现的次数之和 kmp hdu 3336 count the string
- HDU 3336 Count the string(KMP:串前缀匹配自身+DP)
- Hdu 3336 Count the string (KMP+DP 前缀出现次数和)
- hdu 3336 Count the string KMP
- KMP Hdu-3336 Count the string
- HDU 3336 Count the string(KMP 理解)
- HDU 3336 Count the string KMP
- HDU 3336 Count the string(KMP+dp)
- [HDU 3336]Count the String[kmp]
- [HDU 3336]Count the String[kmp][DP]
- HDU 3336 Count the string KMP+DP
- hdu 3336 Count the string(KMP)
- hdu 3336 Count the string KMP+DP
- HDU 3336 Count the string(KMP)
- android项目之小闹钟之准备篇
- 相关链接
- 基于Deep Learning的跟踪算法总结(二)
- Android状态栏微技巧,动态控制状态栏显示和隐藏
- Jdbc
- HDU 3336 Count the string(KMP+求给定字符串含前缀的数量)
- springcloud 的eureka服务注册demo
- STM32之中断与事件---中断与事件的区别
- matlab添加工具箱(2014b版)
- WKWebView适应屏幕宽度
- MATLAB逻辑数组
- struts2+jquery+Ajax异步请求发送与解析json数据
- 自定义BitmapTransformation完美解决Glide加载圆角或者圆形图片
- [Ryzom_service]配置文件中StartCommands运行