HDU 3336 Count the string (next数组活用)
来源:互联网 发布:与妻书读后感知乎 编辑:程序博客网 时间:2024/05/16 08:42
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5224 Accepted Submission(s): 2454
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
Source
HDOJ Monthly Contest – 2010.03.06
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3336
题目大意:给一个字符串,求其每个前缀子串在原串中的匹配次数的和
题目分析:好题就是数据太水了,1 5 ababa显然是9,但是很多跑出来8的程序都AC了,我来说下正解,要理解next数组的含义,next数组的值就是当前子串的后缀与前缀匹配的个数,我们先初始化ans=len,表示每个前缀都只出现了一次,然后根据next数组,找到一个匹配的后缀ans+1,接着对next回溯一直到为0,相当于把子串里蕴含的前缀子串也找出来,举个例子:
s a b a b a
i 0 1 2 3 4 5
next[i] -1 0 0 1 2 3
开始 ans=5
next[3] = 1,ans + 1 = 6,next[1] = 0
next[4] = 2,ans + 1 = 7,next[2] = 0
next[5] = 3,ans + 1 = 8,next[3] = 1,ans + 1 = 9(这里就表示在aba这个后缀里还蕴涵着一个前缀a)
所以最后答案是9
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3336
题目大意:给一个字符串,求其每个前缀子串在原串中的匹配次数的和
题目分析:好题就是数据太水了,1 5 ababa显然是9,但是很多跑出来8的程序都AC了,我来说下正解,要理解next数组的含义,next数组的值就是当前子串的后缀与前缀匹配的个数,我们先初始化ans=len,表示每个前缀都只出现了一次,然后根据next数组,找到一个匹配的后缀ans+1,接着对next回溯一直到为0,相当于把子串里蕴含的前缀子串也找出来,举个例子:
s a b a b a
i 0 1 2 3 4 5
next[i] -1 0 0 1 2 3
开始 ans=5
next[3] = 1,ans + 1 = 6,next[1] = 0
next[4] = 2,ans + 1 = 7,next[2] = 0
next[5] = 3,ans + 1 = 8,next[3] = 1,ans + 1 = 9(这里就表示在aba这个后缀里还蕴涵着一个前缀a)
所以最后答案是9
#include <cstdio>#include <cstring>int const MAX = 1e8;int const MOD = 10007;int next[MAX];char s[MAX];void get_next(){ int i = 0, j = -1; next[0] = -1; while(s[i] != '\0') { if(j == - 1 || s[i] == s[j]) { i++; j++; next[i] = j; } else j = next[j]; }}int main(){ int T, len, ans; scanf("%d", &T); while(T--) { memset(next, 0, sizeof(next)); scanf("%d %s", &len, s); get_next(); ans = len; for(int i = 1; i <= len; i++) { int tmp = next[i]; while(tmp) { ans = (ans + 1) % MOD; tmp = next[tmp]; } } printf("%d\n", ans); }}
0 0
- HDU 3336 Count the string (next数组活用)
- [KMP-NEXT数组特性]HDU 3336 Count the string
- Hdu 3336 Count the string[KMP next数组的理解]
- HDU 3336 Count the string(next数组+DP)
- hdu 3336 Count the string(next数组+dp)
- 【HDU 3336】Count the string 【KMP next数组巧妙应用】
- HDU 3336 Count the string(KMP算法next数组的应用)
- HDU 3336 Count the string(KMP+Next数组递推)
- HDU 3336 Count the string(KMP+稍微DP+next数组的运用)
- HDU 3336 Count the string(kmp next数组的性质)
- Count the string kmp next数组应用
- hdu3336 Count the string(next数组)
- Count the string next数组+DP
- HGU3336 Count the string (KMP Next数组的应用)
- HDU3336-Count the string-KMP(next数组理解)
- Count the string (kmp的next数组运用)
- HDU 3336 Count the string 后缀数组 或 (KMP + DP)
- HDU 3336 Count the string (KMP的nex数组)
- 好话也能让人生厌
- VC++中cl.exe编译器的使用
- Python中多线程的探究
- jQuery弹出Iframe窗口,应该比$.dialog好用
- javascript常用的事件
- HDU 3336 Count the string (next数组活用)
- 使用CL.EXE查看C++中类的内存结构
- 阿里前端的困局与突围
- eclipse导入openfire源码
- MIPI vedio mode introduce
- 网络基础(3)- 网络层:IP地址、子网掩码和路由器的作用
- ARP的C代码实现
- 那些不能错过的Xcode插件
- __I、 __O 、__IO volatile是什么?怎么用?