hdu1358(KMP+最小循环节)
来源:互联网 发布:软件测试基础考题 编辑:程序博客网 时间:2024/05/21 10:20
Period
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2049 Accepted Submission(s): 1010
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
Recommend
JGShining
本题要求所给字符串的长度大于等于2的可以由某一子串循环得到的前缀的长度和循环次数。
此题首先得求最小循环节,用KMP算法。
#include<iostream>#include<cstring>#include<cstdio>using namespace std;const int MAXN=1000000+100;char str[MAXN];//W为模式串,T为主串int next[MAXN];//KMP算法中计算next[]数组void getNext(char *p){ int j,k,len=strlen(p); j=0; k=-1; next[0]=-1; while(j<len) { if(k==-1||p[j]==p[k]) { next[++j]=++k; } else k=next[k]; }}int main(){int n,i,tag=1;while(~scanf("%d",&n),n){scanf("%s",str);getNext(str);printf("Test case #%d\n",tag++);for(i=2;i<=n;i++){if(next[i]&&i%(i-next[i])==0)printf("%d %d\n",i,i/(i-next[i]));}printf("\n");}return 0;}
- hdu1358(KMP+最小循环节)
- [KMP求最小循环节][HDU1358][Period]
- hdu1358 KMP循环节
- hdu1358 最小循环节,最大循环次数 KMP
- HDU1358 Period KMP循环节问题
- HDU1358 Period(KMP,找循环节)
- HDU1358-Period(kmp-求前缀长度和最小循环节长度 )
- hdu1358 kmp的next数组求循环节
- hdu1358 循环节
- hdu1358 Period (循环节)
- HDU1358 Period(KMP找循环前缀)
- hdu1358 KMP
- KMP HDU1358
- hdu1358 kmp
- HDU1358-kmp
- 【KMP】【HDU3746】【最小循环节】
- KMP(最小循环节)
- Period--KMP,最小循环节
- Maya: 菜单 编辑网格 >折痕工具
- uva 993 Product of digits
- 每天一段小代码——链队列
- UVA10719- Quotient Polynomial
- Maya: 菜单 编辑网格 >移除选定对象
- hdu1358(KMP+最小循环节)
- Maya: 菜单 编辑网格 >移除全部
- Maya: 菜单 编辑网格 >折痕集
- UVA10916- Factstone Benchmark
- Hibernate懒加载深入分析
- 关于考研的一些复习视屏
- Maya: 菜单 编辑网格 >指定不可见面
- remoting与socket、webservice和wcf的比较及优势
- 设计模式学习笔记