hdu 3336 Count the string
来源:互联网 发布:已备案的域名转让 编辑:程序博客网 时间:2024/06/11 13:35
点击打开链接
Count the string
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11740 Accepted Submission(s): 5470
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
题意很好明白,但是不能暴力拆分出每一个字串,然后去匹配,那样会超时。要充分利用next数组。
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int N = 200005;char str[N];int Next[N];int len;int mod=10007;void getNext(){Next[0]=-1;int i=0,j=-1;while(i<len){if(j==-1||str[i]==str[j]){i++;j++;Next[i]=j;}elsej=Next[j];}}int main(){ int T; scanf("%d",&T); while(T--) { scanf("%d%s",&len,str); getNext(); int sum=Next[len]+len; for(int i=0;i<len;i++) { if(Next[i]>0&&Next[i]+1!=Next[i+1]) { sum=(sum+Next[i])%mod; } } printf("%d\n",sum); } return 0;}
参考网址:
http://972169909-qq-com.iteye.com/blog/1114968
阅读全文
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
- 友元函数的概念
- Java对XML实现增删查改经验学习
- 软件工程(C编码实践篇)学习心得
- 四大组件之contentProvider联系人数据库DIY
- canvas 画箭头
- hdu 3336 Count the string
- 三消
- 二分查找算法Python3实现
- EXCEL之对单元格批量填充内容
- getsockopt( )函数详解
- SSM框架-MyBatis进阶篇(二)
- 面对对象
- basicexcel
- IntelliJ Idea中debug悬浮以及output/console消失与悬浮的解决办法