Period--KMP,最小循环节
来源:互联网 发布:淘宝日系男装店铺排行 编辑:程序博客网 时间:2024/04/30 12:33
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 16597 Accepted: 7976
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 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.
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
题目链接:http://poj.org/problem?id=1961
我的天,KMP有这么神奇的应用,我以前竟然都没有好好的研究,以后算法要学到家啊。
熟悉KMP的都知道KMP算法中有一个next[]数组,其实这个数组可以求最小循环节,O(len)的算法,太神奇了,我这个题写了个暴力,POJ后台这个题太硬,TLE,问了金桔,然后子祥大大上来特地给我讲了一遍,万分感谢,好人啊。
http://www.cnblogs.com/jackge/archive/2013/01/05/2846006.html
这是讲解kmp求最小循环节,讲的很清楚,大神太多了。
我感觉我就直接上代码吧,上面大神已经讲的很清楚了。
代码:
#include <cstdio>#include <cstring>#include <iostream>#include <cstdlib>#include <string>using namespace std;int next[1000010];void getnext(char t[]){ int i=0,j=-1,l; next[0]=-1; l=strlen(t); while(i!=l){ if(j==-1||t[i]==t[j]){ ++j; ++i; next[i]=j; } else j=next[j]; }}char s[1000010];int main(){ int n; int t=1; while(~scanf("%d",&n)&&n){ scanf("%s",s); getnext(s); printf("Test case #%d\n",t++); for(int i=1;i<=n;i++){ int h=i-next[i]; if(i!=h&&i%h==0) printf("%d %d\n",i,i/h); } cout<<endl; } return 0;}
0 0
- Period--KMP,最小循环节
- poj 1961 Period (KMP+最小循环节)
- POJ 1961 Period KMP 最小循环节
- [KMP求最小循环节][HDU1358][Period]
- POJ 1961 Period【KMP最小循环节】
- UVALive 3026 Period ( kmp 求前缀最小循环节)
- poj1961--Period(KMP求最小循环节)
- POJ 1961 Period(KMP最小循环节)
- (POJ1961)Period <KMP算法求最小循环节>
- KMP + 求最小循环节 --- HDU 1358 Period
- HDU 1358 Period (next跳表找最小循环节)KMP
- POJ 1961 Period——kmp求最小循环节
- Period (HDU_1358) KMP+循环节
- 【kmp算法next数组-串的最小循环节/循环周期】Period HDU
- HDU1358-Period(kmp-求前缀长度和最小循环节长度 )
- LA 3026 && POJ 1961 Period (利用kmp中的next数组找最小的循环节 )
- LA 3026 Period——kmp求n次最小循环节
- [KMP-循环节问题]HDU 1358 period
- Item1 Understand template type deduction
- java servlet的tomcat
- mysql sql语句优化细节
- iconv 文件编码转换
- 1033 旧键盘打字
- Period--KMP,最小循环节
- Android 拖动滑出滑入的布局 自定义ViewDragHelper详解
- 作者(zhang854429783) eclipse通过tomcat热部署web项目
- python第五天学习记录——模块
- 计算几何 BAPC 14 C itadel Construction (Gym 100526C )
- HashMap封装查询到的数据
- 1034 有理数四则运算
- JavaScript学习笔记--语法
- 百度地图配置使用笔记(AndroidStudio)