hdoj 3336 Count the string 【KMP】
2016-02-11 10:07
357 查看
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7175 Accepted Submission(s): 3314
Problem DescriptionIt 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
求前缀在字符串中出现的总次数~
AC代码:
#include<cstdio> #include<cstring> #include<cmath> #include<queue> #define mem(a, b) memset(a, (b), sizeof(a)) #define Wi(a) while(a--) #define Si(a) scanf("%d", &a) #define Pi(a) printf("%d\n", (a)) #define INF 0x3f3f3f3f #define mod 10007 #define LL longlong #include<algorithm> using namespace std; const int N = 200000+10; char s ; int p ; int ls; int num ; void getp() { int i = 0, j = -1; p[i] = j; while(i < ls) { if(j==-1||s[i]==s[j]) { i++, j++; p[i] = j; } else j = p[j]; } } int main() { int t; Si(t); Wi(t){ Si(ls); scanf("%s", s); getp(); int sum = 0; num[0] = 0; for(int i = 1; i <= ls; i++) { num[i] = (num[p[i]]%mod + 1) % mod; sum = (sum%mod + num[i]) % mod; } Pi(sum); } return 0; }
相关文章推荐
- PC与嵌入式驱动引导程序的区别
- 利用阴影和过渡制作精美的立体按钮
- 艾伦·凯(Alan Kay)的深刻见解
- 算法竞赛入门经典第五章习题
- 网页布局CSS初始化代码
- 批处理关于截取变量中字符串(字段)问题的详细说明(转)
- 网页中Logo的样式代码
- 根据设备视口宽度来更换样式表
- [从头学数学] 第81节 总复习
- 欢迎使用CSDN-markdown编辑器
- 利用CSS3媒体查询实现更换样式表
- mysql数据导出权限问题
- 合并两个排序的链表
- UI控件(UISegmentedControl)
- 【C语言】C语言简介
- 网页的流式布局
- 【C语言】C语言简介
- 批处理for命令详解(转)
- 利用Device.js判断设备进行网页布局
- 选择器权重,行内居中