hdu Count the string(KMP)
来源:互联网 发布:庐山站到牯岭镇 知乎 编辑:程序博客网 时间:2024/05/21 18:50
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
题意:给定一字符串,求它所有的前缀出现的次数的和。
这题很纠结,一开始不知道怎么做,如果直接统计子串在主串中出现的次数,orz···肯定TLE,后来发现这题可以直接从next数组入手,因为next数组表示的是子串中最长公共前后缀串的长度,如果用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,所以dt[3]是2,ababa中出现的前缀为a,aba,ababa,所以dt[5]是3,当i=5时,next[5]=3,所以dt[i]=dt[next[i]]+1
理解了上面的部分就很简单了,后面直接套next数组的模板
代码:#include<stdio.h>#include<string.h>#define N 1000001int dt[N],next[N];char str[N];int t,n;void get_next(){ int i=-1,j=0; next[0] = -1; while(j<n) { if(i==-1 || str[i]==str[j]) { i++; j++; next[j] = i; } else i=next[i]; }}int main(){ int i,j,sum; scanf("%d",&t); while(t--) { sum=0; scanf("%d",&n); scanf("%s",&str); get_next(); memset(dt,0,sizeof(dt)); for(i=1;i<=n;i++) { dt[i]=(dt[next[i]]+1)%10007; sum=(sum+dt[i])%10007; } printf("%d\n",sum); } return 0;}
- hdu Count the string(KMP)
- hdu 3336 Count the string(KMP)
- hdu 3336 Count the string(KMP)
- HDU 3336 Count the string(kmp)
- HDU 3336 Count the string(KMP)
- HDU 3336 Count the string(KMP)
- 【hdu 3336】Count the string(kmp)
- 【HDU 3336】Count the string(kmp)
- 【HDU-3336-count the string】(KMP)
- Count the string(KMP)
- hdu 3336 Count the string(KMP+dp)
- HDU 3336 Count the string(KMP 入门)
- hdu 3336 Count the string (DP+kmp)
- hdu 3336 Count the string(扩展KMP模板)
- hdu 3336 count the string(KMP+dp)
- HDU Count the string 【dp KMP】(求子串总数)
- Hdu 3336 Count the String(DP+KMP)(好题)
- hdu 3336 Count the string(KMP+dp)
- [转]ant的build.xml文件详解备忘
- C#调用非托管dll debug问题
- Ubuntu 12.04 办公软件简介
- final与static详解
- 浏览器访问时设置主页
- hdu Count the string(KMP)
- 中国版的日和-十万个冷笑话
- IIS6 Framework2.0 升级Framework4.0 IIRF不能使用处理
- 我对套接字描述符的理解
- 《研磨struts2》 第一章 Struts2概述 之 Struts2和MVC
- 《研磨struts2》 第二章 Struts2的HelloWorld 之 概述
- 当今几大主流服务器的操作系统简介
- marquee向上滚动
- 《研磨struts2》 第二章 Struts2的HelloWorld 之从Servlet+JSP+JavaBean实现MVC开始