poj1961--Period(KMP求最小循环节)
来源:互联网 发布:微信群淘宝客机器人 编辑:程序博客网 时间:2024/04/30 09:07
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 13511 Accepted: 6368
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
Source
Southeastern Europe 2004
和poj1961相同,http://blog.csdn.net/winddreams/article/details/40268107
不过是多加了一个对从头到每个字符的判断。
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int next[1100000] ;char s[1100000] ;void getnext(int l){ int j = 0 , k = -1 ; next[0] = -1 ; while( j < l ) { if( k == -1 || s[j] == s[k] ) next[++j] = ++k ; else k = next[k] ; }}int main(){ int n , i , num = 1 , l ; while(scanf("%d", &n) && n) { scanf("%s", s); getnext(n); printf("Test case #%d\n", num++); for(i = 1 ; i <= n ; i++) { l = i - next[i] ; if( i%l==0 && i/l != 1 ) printf("%d %d\n", i, i/l); } printf("\n"); } return 0;}
2 0
- poj1961--Period(KMP求最小循环节)
- (POJ1961)Period <KMP算法求最小循环节>
- poj1961 period KMP求循环节
- poj1961——Period(KMP循环节)
- [KMP求最小循环节][HDU1358][Period]
- poj1961 KMP求循环节
- [POJ1961]Period(KMP)
- poj1961 KMP(循环节)
- Period--KMP,最小循环节
- UVALive 3026 Period ( kmp 求前缀最小循环节)
- KMP + 求最小循环节 --- HDU 1358 Period
- POJ 1961 Period——kmp求最小循环节
- HDU1358-Period(kmp-求前缀长度和最小循环节长度 )
- poj1961 & hdu 1358 Period(KMP)
- poj1961—Period(kmp周期性质)
- 【KMP】 poj1961 Period
- poj1961 Period----KMP
- poj1961 Period (KMP)
- html使用列表 以及div的布局和table的布局
- HDOJ题目1505 City Game(动态规划)
- Java 学习 第三章 Java核心-继承与多态
- ANDROID L——Material Design详解(视图和阴影)
- struts2的优点
- poj1961--Period(KMP求最小循环节)
- 一个人的旅行 hdu 2066
- 使用ASP.NET MVC 4 Bootstrap Layout Template(VS2012)
- bluetooth LE HOGP profile的代码大致实现流程(HOGP+GATT)
- pat 1006
- Swift基础--ijkplayer编译
- struts2如何完成文件的上传
- Xcode及Mac快捷键大全
- ContentProvider(内容提供者)用法详解