hdoj 3336 Count the string
2015-09-09 22:22
351 查看
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6627 Accepted Submission(s): 3067
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each case, output only one number: the sum of the match times for all the prefixes of s mod 10007.
[align=left]Sample Input[/align]
1 4 abab
[align=left]Sample Output[/align]
6 思路:给出一个长度为l的字符串,它有l个前缀,求这个字符串包含这些前缀的总个数。 代码:#include<stdio.h> #include<stdlib.h> #include<string.h> #include<algorithm> #define M 200000+10 using namespace std; char s[M]; int p[M],dp[M]; int l; void getp() { int i=0,j=-1; p[i]=j; while(i<l) { if(j==-1||s[i]==s[j]) { i++; j++; p[i]=j; } else j=p[j]; } } int main() { int t; int i; int cnt; scanf("%d",&t); while(t--) { scanf("%d",&l); scanf("%s",s); getp(); cnt=0; dp[0]=0; for(i=1;i<=l;i++) { dp[i]=(dp[p[i]]+1)%10007; cnt=(cnt+dp[i])%10007; } printf("%d\n",cnt); } return 0; }
相关文章推荐
- Add Binary
- 安卓对比苹果开发
- maven -tomcat 插件如何修改端口和虚拟目录
- jquery封装 [ 限制文本框只能输入数字和小数] 语句,简单调用即可
- Asp.Net 密码加密技术
- 知乎上摘录的书单
- Spring框架的设计理念与设计模式分析
- maven链接接口
- 每天一道算法题(36)——8皇后问题
- 每天一道算法题(36)——8皇后问题
- 购物网站的发展历史
- 0909 对操作系统的认识
- JDBC学习笔记2
- 系统运维做什么
- K-means聚类算法
- Redis学习2之redis-benchmark使用方法总结
- mac unix 下使用 scp 命令
- 终于解决困扰我多年的问题 浙江绍兴这边 洋拉毛树 树名原来叫 毛白杨 春天种子满天飞
- Codeforces 479D Long Jumps (set + 迟取法)
- HTML中引入资源相对路径