POJ 1961 Period kmp
来源:互联网 发布:网络加速器国外节点 编辑:程序博客网 时间:2024/05/24 01:27
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 14726 Accepted: 7009
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
AC code:
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#define maxn 1000005using namespace std;int next[maxn];int main(){ char s[maxn]; int loop=1; int k,len,i,j; while(cin>>len&&len){ scanf("%s",s); printf("Test case #%d\n",loop++); j=0,k=-1; next[0]=-1; while(j<len){ if(k==-1||s[j]==s[k]){j++;k++; next[j]=k; } else k=next[k]; } for(int i=1;i<=len;++i){ ///printf("next[%d]: %d \n",i,next[i]); if(i%(i-next[i])==0&&i/(i-next[i])>1) printf("%d %d\n",i,i/(i-next[i])); } putchar('\n'); } return 0;}
0 0
- poj 1961:Period (KMP)
- poj 1961 Period (KMP)
- poj 1961 Period---kmp
- POJ 1961-Period:KMP
- poj 1961 Period KMP
- poj 1961 Period(KMP)
- Period - POJ 1961 KMP
- POJ 1961 Period (KMP)
- POJ Period 1961【KMP】
- POJ 1961 Period kmp
- poj 1961 Period 【KMP】
- POJ-1961(Period)(kmp())
- [poj 1961]Period[kmp]
- POJ 1961 Period (KMP)
- POJ 1961 Period(KMP)
- |poj 1961|KMP|Period
- Poj-1961-Period-【KMP】
- POJ 1961 Period (KMP)
- 添加超链接
- Watch OS 2 Complication 开发教程 (二) (持续连载中)
- 机器学习理论依据
- linux常用命令
- HashMap和HashSet的底层实现
- POJ 1961 Period kmp
- Spring入门
- 递归
- 华为OJ平台试题 —— 字符串:图片整理
- {System.InvalidOperationException: 无效操作。连接被关闭。
- [LeetCode164] Maximum Gap
- Poj 2826 An Easy Problem!
- 关于self点操作访问和下划线访问的区别
- android 编译共享ccache的缓存