Period - POJ 1961 KMP
来源:互联网 发布:mac快捷键 编辑:程序博客网 时间:2024/05/27 20:57
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 12498 Accepted: 5828
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
题意:输出所有的前缀循环情况。
思路:KMP。
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;char str[1000010];int f[1000010];int n;void getfail(){ int i,j; memset(f,0,sizeof(f)); f[0]=0;f[1]=0; for(i=1;i<=n;i++) { j=f[i]; while(j && str[i]!=str[j]) j=f[j]; if(str[i]==str[j]) f[i+1]=j+1; else f[i+1]=0; }}int main(){ int t=0,i,j,k; while(~scanf("%d",&n) && n>0) { scanf("%s",str); getfail(); if(t!=0) printf("\n"); printf("Test case #%d\n",++t); for(i=2;i<=n;i++) if(f[i] && i%(i-f[i])==0) printf("%d %d\n",i,i/(i-f[i])); }}
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)
- C++学习笔记9,堆栈与堆的区别
- 1142A Walk Through the Forest
- 内部类与内存泄漏(Handler,Runnable)
- css box-sizing
- Eclipse 插件整理
- Period - POJ 1961 KMP
- UML图(九) 部署图
- QT QTableView用法
- 剑指offer面试题3
- Power Strings - POJ 2406 KMP
- MSP430F247串口发送字符串并接受PC机发来的单字符并送回电脑显示
- 如何让32位编译的程序在64位系统中正常运行
- 编程挑战-高校俱乐部-F(X) 及-- 数因子集合
- 题目1163:素数(2008年北京航空航天大学计算机研究生机试真题)