HDU3336-Count the string(KMP)
来源:互联网 发布:mac梦幻手游 编辑:程序博客网 时间:2024/04/29 22:26
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4449 Accepted Submission(s): 2094
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
题目意思:统计所以前缀在原串出现的次数
思路:利用KMP next函数,next函数统计的就是前缀跟自身字符串匹配的信息。
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <string>#include <algorithm>#include <queue>using namespace std;const int maxn = 200000+10;const int MOD = 10007;char str[maxn];int next[maxn],n;void getNext(){ next[0] = next[1] = 0; int ans = n; for(int i = 1; i < n; i++){ int j = next[i]; while(j && str[i] !=str[j]) j = next[j]; if(str[j] == str[i]){ next[i+1] = j+1; }else{ next[i+1] = 0; } }}int main(){ int ncase; cin >> ncase; while(ncase--){ scanf("%d%s",&n,str); getNext(); int ans = n%MOD; for(int i = 1; i <= n; i++){ if(next[i] !=0){ ans = (ans+1)%MOD; } } printf("%d\n",ans); } return 0;}
0 0
- HDU3336-Count the string(KMP)
- HDU3336 Count the string(KMP)
- hdu3336 Count the string (KMP)
- hdu3336 Count the string(kmp+dp)
- hdu3336(kmp)Count the string
- 【KMP】 hdu3336 Count the string
- hdu3336 Count the string-------KMP
- hdu3336 Count the string KMP
- [KMP][HDU3336][Count the string]
- HDU3336 Count the string (KMP)
- hdu3336(Count the string)KMP的应用
- hdu3336—Count the string(kmp+dp)
- hdu3336 Count the string KMP+dp
- hdu3336 Count the string(kmp+dp)
- hdu3336 Count the string(KMP应用)
- hdu3336 Count the string--KMP+DP
- HDU3336 Count the string KMP+递推
- [dp][KMP][hdu3336]Count the string
- 包含流的方式调用servlet
- 如何用一个月的时间准备google的技术面试
- as3对应照片信息旋转的修正
- hdu 1576 A/B
- ARM SPSR (Saved Program Status Registers)
- HDU3336-Count the string(KMP)
- 深入浅出讲解:php的socket通信
- Android Fragment与Activity之间的数据交换(Fragment从Activity获取数据)
- Delphi5 & Delphi6 报错处理bordbk50.dll bordbk61.dll
- 数组字符串系列之:删除输入字符串中重复的字符
- 桌面音频文件被删怎么办
- socket连接传输对象无响应
- Android提交数据到服务器的两种方式四种方法
- ubuntu解析dns慢,无法加载样式表