poj1961解题报告
来源:互联网 发布:知豆新能源汽车 编辑:程序博客网 时间:2024/04/28 07:36
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 13616 Accepted: 6417
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
源代码:
#include<iostream>#include<cstring>using namespace std;int next[1000010];char ch[1000010];int len;void getnext(){ int i,j;i=0;j=-1;next[0]=-1;while (i!=len){ if (j==-1 || ch[i]==ch[j])next[++i]=++j;else j=next[j];}}int main(){ int i,length,t=1;while (cin>>len && len!=0){ scanf("%s",ch);getnext();cout<<"Test case #"<<t<<endl;t++; for (i=1;i<=len;++i){ length=i-next[i];if (i!=length && i%length==0)cout<<i<<" "<<i/length<<endl;}cout<<endl;}return 0;}
本题题意:本题跟2406差不多,就是要再进行一次遍历,寻找出所有能够循环的次数,给你一个字符串,你要将里面可以循环的区间都求出来,但是区间的开头必须是从0开始的,遍历一遍,找出从0开始可以循环的全部符合要求的区间,再把区间里面循环的次数给输出出来,同样也是用了kmp算法的求next数组,两道题几乎相似,推荐大家做kmp算法类型的题目时候1961和2406一起做,这样更容易巩固。
0 0
- poj1961解题报告
- poj1961
- poj1961
- POJ1961
- poj1961
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- POJ2406 & POJ1961 详细解题思路和AC程序 KMP算法变种
- Antiprime解题报告
- expr解题报告
- 华容道解题报告
- tju解题报告
- zju1062/pku1095解题报告
- live555 编译
- 看书《DIV+CSS商业案例与网页布局开发精讲》_DOCTYPE的选择_随手笔记
- 压缩感知与Nquist抽样定理——模拟信息转换(AIC)学习总结
- 关于Linux下C编译错误(警告)cast from 'void*' to 'int' loses precision
- storm-0.9.3 wordcount例子运行步骤(单机版)
- poj1961解题报告
- 调整java虚拟机(JVM)内存大小
- eayui datagrid 分页 排序 详解
- uva--11129An antiarithmetic permutation+分治
- 最简单的哈密顿圈
- BZOJ1006
- spring 配置定时器
- STL 算法
- 关于用sublime text直接编译python的设置