hdoj_3336Count the string(KMP)
来源:互联网 发布:元数据与主数据区别 编辑:程序博客网 时间:2024/06/06 13:02
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2808 Accepted Submission(s): 1308
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
做的几个题都利用了next数组的性质,好强大的看毛片算法
#include<iostream>#include<cstdio>#include<cstring>using namespace std;#pragma warning(disable : 4996)#define MAX 200005int n;char text[MAX];int Next[MAX];void get_next(){Next[1] = 0;int i, j = 0;for(i = 2; i <= n; i++){while(j > 0 && text[j+1] != text[i]){j = Next[j];}if(text[j+1] == text[i]){j += 1;}Next[i] = j;}}int main(){freopen("in.txt", "r", stdin);int sum, t;scanf("%d", &t);while (t--){scanf("%d", &n);scanf("%s", text + 1);get_next();sum = 0;/*for(int i = 1; i <= n; i++){cout << Next[i] << " ";}cout << endl;*/for(int i = 1; i <= n; i++){int j = i;while (j != 0){sum++;j = Next[j];}}printf("%d\n", sum % 10007);}return 0;}
- hdoj_3336Count the string(KMP)
- Count the string(KMP)
- hdu Count the string(KMP)
- hdu 3336 Count the string(KMP)
- HDU3336-Count the string(KMP)
- hdu 3336 Count the string(KMP)
- HDU 3336 Count the string(kmp)
- HDU 3336 Count the string(KMP)
- HDU_3336 Count the string(KMP)
- HDU 3336 Count the string(KMP)
- HDU3336 Count the string(KMP)
- hdu3336 Count the string (KMP)
- 【hdu 3336】Count the string(kmp)
- hdu3336 Count the string(kmp+dp)
- 【HDU 3336】Count the string(kmp)
- 【HDU-3336-count the string】(KMP)
- hdu3336(kmp)Count the string
- Count the string + KMP
- mybatis3 增删改查额
- 算法题:连续子数组的最大和
- Canvas绘制小树
- 第九周--项目4-一元一次方程类
- Awk notes
- hdoj_3336Count the string(KMP)
- 【OpenCV-图像处理】用sift特征点算法和ransac算法进行多幅图像的拼接
- 解决maven管理下,java.lang.ClassNotFoundException: org.springframework.web.context.ContextLoaderServlet
- poj-2355-简单dp
- 毕业设计-利用nutch中Outlink类的方法获取数据库属性值
- Ubuntu 中软件的安装、卸载以及查看的方法总结
- Oracle9i/10g/11g & OPatch Download(2012-10-11 update)
- solaris10在vm8.0上安装
- solaris系统学习