数据结构--KMP|HDU 3336 Count the string(KMP:求一个字符串所有前缀在这个字符串中出现的次数总和)
Problem Description 【数据结构--KMP|HDU 3336 Count the string(KMP:求一个字符串所有前缀在这个字符串中出现的次数总和)】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.
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 Input1 4 abab
Sample Output6
题意： 给定一个字符串，找出他的所有前缀，输出这些前缀在这个字符串中出现的次数总和
思路： KMP中对next数组的理解，for(int i=1; i<=m; i++)，如果f[i]不为0，则证明字符串的某一段和某一前缀相同，则ans加2；如果f[i]为0，则证明不存在字符串的某一段与某一前缀相同，则ans加1
代码：
#include
#include
#include
#include
#include
using namespace std;
const int MAXM=200000+100;
const int MOD=10007;
char P[MAXM];
int f[MAXM],dp[MAXM];
int m;
void getFail(char *P,int *f)
{
f[0]=f[1]=0;
for(int i=1;
i 推荐阅读
- 《数据结构与算法之美》——队列
- 笔记|C语言数据结构——二叉树的顺序存储和二叉树的遍历
- Java深入了解数据结构之栈与队列的详解
- Java集合框架|Java集合框架 数据结构
- 数据结构与算法|【算法】力扣第 266场周赛
- 数据结构和算法|LeetCode 的正确使用方式
- 一个好的算法应该如何评测（数据结构学习1）
- XS-Java数据结构和算法目录总纲【2020-10-24~2021-2-12】
- （数据结构入门）2018-06-23
- Java数据结构与算法（十）排序算法01