HDU3336:Count the string
来源:互联网 发布:电子杂志免费制作软件 编辑:程序博客网 时间:2024/05/27 16:40
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
/*题意:给以字符串 计算出以前i个字符为前缀的字符中 在主串中出现的次数和 如: num(abab)=num(a)+num(ab)+num(aba)+num(abab)=2+2+1+1=6;题解:next[i]记录的是 长度为i 不为自身的最大首尾重复子串长度 num[i]记录长度为next[i]的前缀所重复出现的次数*/#include <stdio.h>#include <string.h>#include <iostream>using namespace std;#define MAXN 200005#define MOD 10007int next[MAXN],sum[MAXN],n;char str[MAXN];void getnext(){ int i = 0,j = -1; next[0] = -1; for(;str[i];) if(j == -1 || str[i] == str[j]) { ++i; ++j; next[i] = j; } else j = next[j];}int main(){ int t,ans; cin >> t; while(t--) { getchar(); cin >> n; ans = 0; memset(sum,0,sizeof(sum)); scanf("%s",str); getnext(); for(int i = 1; i<=n; i++) sum[next[i]] = (sum[next[i]]+1)%MOD; for(int i = 1; i<=n; i++) { if(sum[i]) ans=(ans+sum[i]+1)%MOD; else ans = (ans+1)%MOD; } cout << ans << endl; } return 0;}
- hdu3336 Count the string
- hdu3336 Count the string
- HDU3336:Count the string
- hdu3336-Count the string
- hdu3336 Count the string
- hdu3336 Count the string
- hdu3336----Count the string
- hdu3336 Count the string
- 【HDU3336】【Count the string】
- HDU3336 Count the string
- HDU3336-Count the string
- 【KMP】 hdu3336 Count the string
- hdu3336 Count the string-------KMP
- hdu3336 Count the string KMP
- [KMP][HDU3336][Count the string]
- HDU3336 Count the string (KMP)
- HDU3336-Count the string(KMP)
- hdu3336 Count the string KMP+dp
- EXT tree 事件
- 编程之美_006寻找发帖水王
- Android HandlerThread使用小例
- mvc使用ajax(json的前后台处理)
- 华为荣耀四核,通知栏音效频繁提示解决!
- HDU3336:Count the string
- 浅析busybox查找命令和调用相应命令函数的实现流程框架
- LVS/DR配置笔记
- 布局相关我犯的错误
- vb CreateObject("Scripting.FileSystemObject") 48错误
- 【二维数组】统计英文大写字母,小写字母,数字,空格,以及其他字符的个数
- zend 框架中的 主从数据库部署
- C++日记——list的erase用法(erase迭代删除运行时出错)
- [转]Java继承中的成员方法和变量