Period
来源:互联网 发布:效能时间软件 编辑:程序博客网 时间:2024/05/16 16:06
Period
Time Limit: 1000MS Memory limit: 65536K
题目描述
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.
输入
The input file 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.
输出
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.
示例输入
3aaa12aabaabaabaab0
示例输出
Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
12 4
这个题和 Power Strings其实是一个性质,只不过要把所有可能的子字符串写出来,只需在运行时只要有可能的就输出。。。
#include<stdio.h>#include<string.h>char t[110000000];int next[11000000];int main(){ int n,m,i,j,k; int len1,len2; int s=1; while(scanf("%d",&n)!=EOF) { if(n==0) break; getchar(); for(k=0; k<n; k++) { scanf("%c",&t[k]); } printf("Test case #%d\n",s++); i=0,j=-1; next[0]=-1; while(i<n) { if(j==-1||t[i]==t[j]) { i++; j++; if(t[i]!=t[j]) next[i]=j; else next[i]=next[j]; if(i%(i-j)==0&&i/(i-j)>1) { int l=i/(i-j); printf("%d %d\n",i,l); } } else j=next[j]; } printf("\n"); } return 0;}
0 0
- Period
- Period
- period
- Period
- Period
- Period
- Period
- period
- Period
- Period
- Period
- Posting Period
- hdu1358 Period
- hdu1358 Period
- W - Period
- poj1961 Period
- HDU1358:Period
- HDU1358--Period
- 软件概要设计
- C++中对成员访问操作符->的重载
- 月老的烦恼(1)
- 2014.02.15 重构代码之按不同级部门统计报表的实现总结(后台实现)
- 学习3bash
- Period
- 百姓的“爱心”经受不起折腾,你怎么看待“爱心香蕉”
- 一支相思曲,一阕蝶恋花
- 贪心水题
- 线程存储
- 网络模型
- Knapsack problem poj 3264
- 树(2)--二叉树的遍历(非递归)+线索二叉树
- 贪心与标记