HDU 1358——Period(KMP 失配函数)
来源:互联网 发布:2016淘宝盗图处罚规则 编辑:程序博客网 时间:2024/06/01 08:03
Period
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2965 Accepted Submission(s): 1486
Problem Description
For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as AK , that is A concatenated K times, for some string A. Of course, we also want to know the period K.
Input
The input file consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S. The second line contains the string S. The input file ends with a line, having the number zero on it.
Output
For each test case, output “Test case #” and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.
Sample Input
3aaa12aabaabaabaab0
Sample Output
Test case #12 23 3Test case #22 26 29 312 4
————————————————————————————————————————————————————
题意:
给定一个长度为n的字符串s,求一个最大的整数K>1 ,使得s的前i个字符组成的前缀是某个字符串重复K次得到,输出所有存在K的 i 和对应的 K
思路:
如果一个字串是循环串,那么i%(i-next[i])==0 ,循环的次数为i/(i-next[i]),又k>1 所以next[i]>0
#include<cstdio>#include<cstring>#include<iostream>#include<cstdlib>#define M 1000000+10using namespace std;char str[M];int f[M];void get_next(char *p){ int l=strlen(p); f[0]=-1; int j=-1,i=0; while(i<l){ if(j==-1||p[i]==p[j]){ i++; j++; f[i]=j; } else j=f[j]; }}int main(){ int n; int cas=1; while(scanf("%d",&n),n){ scanf("%s",str); get_next(str); printf("Test case #%d\n",cas++); for(int i=2;i<=n;++i){ if(f[i]>0&&i%(i-f[i])==0) printf("%d %d\n",i,i/(i-f[i])); } printf("\n"); } return 0;}
12332
0 0
- HDU 1358——Period(KMP 失配函数)
- hdu--1358--KMP算法失配函数getfail()的理解--Period
- uvalive 3026 Period KMP(失配函数)
- LA 3026 Period (KMP失配函数)
- LA-3026 - Period-MP算法-失配函数-寻找循环节 (kmp)
- LA 3026 - Period KMP失配函数的应用
- UVa 1328 Period (KMP&失配函数的理解)
- HDU 1358 Period ——kmp
- hdu 3746 Cyclic Nacklace KMP(失配函数)
- hdu——1358Period(kmp专练)
- hdu 1358 Period(KMP)
- hdu 1358 Period(KMP)
- HDU 1358 Period(KMP)
- HDU 1358 Period(kmp)
- HDU - 1358 - Period (KMP)
- HDU 1358 Period (KMP)
- hdu 1358 Period(KMP)
- 【hdu 1358】Period(kmp)
- HDU4911-Inversion(树状数组)
- UVA11636- Hello World!
- c++之排序(template)
- RQNOJ-36 数石子
- VB导出Excel
- HDU 1358——Period(KMP 失配函数)
- hd 2090 ny 316 算菜价
- NYOJ 56 阶乘因式分解
- hdu 3016 Man Down (线段树 + dp)
- 字典树数组实现
- 基于V8引擎的C++和JS的相互交互
- 编译C++ 程序的过程
- 常用的不可变的字符串处理的实例方法 API文档 NSString
- jquery中获取id值方法