HDOJ 3336 Count the string
来源:互联网 发布:网络名誉侵权纠纷法条 编辑:程序博客网 时间:2024/05/17 04:24
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6627 Accepted Submission(s): 3067
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
Recommend
lcy | We have carefully selected several similar problems for you: 3341 2222 3339 3337 3333
#include <cstdio>#include <cstring>const int N = 200010;const int MOD = 10007;char str[N];int next[N];void get_next() {int i = 0, j = -1;next[i] = j;while (str[i]) {if (j == -1 || str[i] == str[j]) next[++i] = ++j;elsej = next[j];}}int main() {int T;scanf("%d", &T);while (T--) {int len;scanf("%d%s", &len, str);get_next();int ans = len % MOD;for (int i = len; ; i = i - next[i]) {while (next[i] <= 0)--i;if (i <= 0)break;ans = (ans + next[i]) % MOD;}printf("%d\n", ans);}return 0;}
0 0
- hdoj 3336 Count the string
- HDOJ 3336 Count the string
- HDOJ 3336 Count the string
- HDOJ 3336 Count the string
- 【KMP】 HDOJ 3336 Count the string
- HDOJ 3336 Count the string KMP
- HDOJ Count the string 3336【KMP】
- hdoj 3336 Count the string 【KMP】
- HDOJ 题目3336Count the string(kmp)
- 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 3336 Count the string
- HDU-Count the string -3336
- CDH离线安装
- K路归并
- 13个JavaScript图表图形绘制插件
- 程序员面试、算法研究、编程艺术、红黑树、数据挖掘5大系列集锦
- Mongodb地理空间索引
- HDOJ 3336 Count the string
- 微信开发的基本知识
- 编译openwrt官方不支持的路由型号固件——以WR720N为例
- 【转】HTTP协议漫谈
- 使用意图链接活动
- ReactiveCocoa指南二:Twitter搜索实例
- CentOS系统中常用查看日志和命令
- [9]Palindrome Number
- tomcat远程调试