欢迎访问~原文出处——博客园-zhouzhendong 去博客园看该题解 题目传送门 - HDU3336 题意概括 给T组数据,每组数据给一个长度为n的字符串s.求字符串每个前缀出现的次数和,结果mod 10007. 题解 首先闭着眼睛KMP跑一跑. 然后我们来dp. dp[i]表示以第i位结尾的前缀个数. 那么,根据Next的含义,不难写出dp[i]=dp[Next[i]]+1的转移方程式. 然后就OK了. 代码 #include <cstring> #include <algorit…

题目链接:https://vjudge.net/problem/HDU-3336 Count the string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11760    Accepted Submission(s): 5479 Problem Description It is well known that AekdyCoi…

Count the string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3351    Accepted Submission(s): 1564 Problem Description It is well known that AekdyCoin is good at string problems as well as n…

Count the string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8594    Accepted Submission(s): 3969 Problem Description It is well known that AekdyCoin is good at string problems as well as nu…

题意是问所有前缀出现的次数和,mod10007: 想一想next数组代表什么意思,是从当前失配位置走到上一个匹配位置的后面,next[i]的值说明以当前位置为结尾,长度为next[i]的后缀,与以开头元素为起始,长度为next[i] 的前缀是相同的,那么方法就很容易了,对于每个j = i,沿着next[j]往前走,到0为止,记录走过的次数,就是前缀的出现次数. #include<cstdio> #include<algorithm> #include<cstring>…

题意 计算所有S的前缀在S中出现了几次 思路 跟前缀有关的题目可以多多考虑KMP的NEXT数组 #include <cstdio> #include <cstring> #include <iostream> #include <cstdlib> using namespace std; char S[2000000]; int NEXT[2000000]; int dp[2000000];//dp[i] 表示 以i结尾的子串与前缀相等的个数 d[i]=d[…

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&qu…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3336 很容易想到用kmp 这里是next数组的应用 定义dp[i]表示以s[i]结尾的前缀的总数 那么dp[i]=dp[next[i]]+1; 代码: #include<stdio.h> #include<string.h> ; ; int dp[MAXN]; char str[MAXN]; int next[MAXN]; void getNext(char *p) { int j,k…

居然一A了,说明对朴素的KMP还是有一定理解. 主要就是要知道next数组的作用,然后就可以计算每个i结尾的满足题意的串个数. #include<cstdio> #include<cstdlib> #include<iostream> #include<cstring> #include<string> #include<algorithm> #include<memory.h> using namespace std;…

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"…