hdu 3336 Count the string
来源:互联网 发布:美萍医药软件 编辑:程序博客网 时间:2024/06/06 18:37
http://acm.hdu.edu.cn/showproblem.php?pid=3336
Count the string
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
如果用dt[i]表示该字符串前i个字符中出现任意以第i个字符结尾的前缀的次数,它的递推式是 dt[i]=d[next[i]]+1,即以第i个字符结尾的前缀数等于以第next[i]个字符为结尾的前缀数加上它自己本身
i 1 2 3 4 5 6
字符串 a b a b a b
dt[i] 1 1 2 2 3 3
aba中出现的前缀为a,aba,所以num[3]是2,ababa中出现的前缀为a,aba,ababa,所以num[5]是3,当i=5时,Next[5]=3,所以num[i]=num[Next[i]]+1
理解了上面的部分就很简单了,后面直接套next数组的模板
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include <cmath>#include <cstdlib>#include <limits>#include <queue>#include <stack>#include <vector>#include <map>using namespace std;#define N 254010#define INF 0x3f3f3f3f#define PI acos (-1.0)#define EPS 1e-8#define met(a, b) memset (a, b, sizeof (a))char s[N];int Next[N], num[N], len;void get_next ();int main (){ int t; scanf ("%d", &t); while (t--) { int sum = 0; scanf ("%d %s", &len, s); get_next (); for (int i=1; i<=len; i++) { num[i] = (num[ Next[i] ] + 1) % 10007; sum += num[i]; sum %= 10007; } printf ("%d\n", sum); } return 0;}void get_next (){ int i = 0, j = -1; Next[i] = -1; while (i < len) { if (j == -1 || s[i] == s[j]) Next[++i] = ++j; else j = Next[j]; } return;}
0 0
- HDU 3336 Count the string
- hdu 3336 Count the string
- hdu 3336 Count the string
- hdu 3336 Count the string
- hdu 3336 Count the string
- hdu 3336 Count the string
- hdu 3336 Count the string
- HDU-Count the string -3336
- hdu 3336 Count the string
- HDU 3336 Count the string
- HDU 3336Count the string
- HDU 3336Count the string
- hdu 3336 Count the string
- hdu 3336 count the string
- HDU 3336 Count the string
- HDU - 3336 Count the string
- hdu 3336 Count the string
- hdu 3336 Count the string
- javascript如何获取当前网页的源码
- 构建高性能WEB之HTTP首部优化
- 【构】游戏命令模式的那些事儿
- js获取网页选中部分的内容,包含html代码
- 获取HTML标签当前在网页中的绝对位置
- hdu 3336 Count the string
- C#学习之路,学习笔记 1.1 C#简介
- ACM学习-分队问题
- 变量作用域
- 算法题查询学生成绩
- 一次真实的DDoS攻击防御实战
- c/c++: uint8_t uint16_t uint32_t uint64_t size_t ssize_t数据类型
- 黑马程序员——c语言基础之文件的概念及操作
- Java Web开发3___Servlet与JSP的区别