POJ-1961 Period-KMP前缀串重复次数
来源:互联网 发布:淘宝网内衣店 编辑:程序博客网 时间:2024/05/24 06:14
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 14803 Accepted: 7054
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
/* *Copyright (c)2015,烟台大学计算机与控制工程学院 *All rights reserved. *作 者:单昕昕 *完成日期:2015年8月25日 *版 本 号:v1.0 */ #include <cstdio>#include <cstring>#include <iostream>using namespace std;const int maxw=1000000+10;char a[maxw];int next[maxw];int main(){ int n,i,t=1; while(cin>>n&&n!=0) { scanf("%s",a); next[0]=-1; next[1]=0; int p=0; printf("Test case #%d\n",t++); for(i=2; i<=n; i++) { while(p>=0&&a[p]!=a[i-1]) p=next[p]; next[i]=++p; int count=i/(i-next[i]); if(i%(i-next[i])==0&&next[i]!=0)//i-next[i]为循环节长度 { printf("%d %d\n",i,count); } } putchar('\n'); } return 0;}
0 0
- POJ-1961 Period-KMP前缀串重复次数
- poj 1961 Period (最小重复子串 kmp)
- 【 poj 1961 】Period 【KMP 求所有前缀的循环节】
- POJ 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)
- 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)
- 如何用Maven创建web项目(具体步骤)(转载)
- App版本更新时对SQLite数据库升级或者降级遇到的问题
- ubuntu wine gnome-keyring-pkcs11.so问题
- GDI+屏幕截图(二)
- 疯狂Android讲义第一讲
- POJ-1961 Period-KMP前缀串重复次数
- JavaWeb笔记——上传文件
- 黑马程序员—IOS基础视频—多态点语法类对象
- C#中的Dictionary简介
- Linux下用tc控制网络延时和丢包率
- VS2010/MFC编程入门之二十六(常用控件:滚动条控件Scroll Bar)
- iOS开发之调用系统打电话发短信接口以及程序内发短信
- ie 默认文档模式
- 手动Handler与Thread处理UI数据同步问题