hdu-1358 period(求周期串)
来源:互联网 发布:90后 网络行为 编辑:程序博客网 时间:2024/06/06 01:22
Period
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2816 Accepted Submission(s): 1405
Problem 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 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.
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算法求next数组缩短时间<span style="font-family:Arial;font-size:14px;">#include<stdio.h>#define MAX 1000009int next[MAX];char s[MAX];int n;</span><span style="font-family:Arial;font-size:14px;">//求next数组void getnext(){ int i=0,j=-1; next[0]=-1; while(i<n){ if(j==-1||s[i]==s[j]){ i++; j++; next[i]=j; } else j=next[j]; }}int main(){ int num=0; while(scanf("%d",&n)!=EOF&&n!=0){ num++; scanf("%s",s); getnext(); printf("Test case #%d\n",num); int i; for(i=1;i<n;i++){ if(next[i+1]!=0&&(i+1)%(i+1-next[i+1])==0)//key printf("%d %d\n",i+1,(i+1)/(i+1-next[i+1])); } printf("\n"); } return 0;}</span>
0 0
- hdu-1358 period(求周期串)
- HDU 1358 Period (kmp求周期)
- HDU 1358 Period 求周期串(kmp)
- HDU 1358 Period(KMP求周期)
- [HDU 1358]Period[kmp求周期]
- HDU 1358Period(KMP周期串)
- poj 1961 Period(KMP求周期)
- HDU 1358 Period(next数组+周期+循环节)
- HDU 5908 Abelian Period(求循环周期,取模优化)【BestCoder Round #88】
- HDU 1358 Period (kmp求循环节)
- HDU 1358 Period(KMP求前缀子串的循环次数)
- hdu 1358 period 求循环节 KMP
- hdu 1358 Period nex[]求循环节
- hdu 1358 Period(求循环节)
- HDU-1358 Period(KMP求循环节)
- hdu 3746 (求串的最小正周期)
- uva 1328 - Period (周期串的判断 kmp)
- hdu 1358 Period(KMP)
- UBUNTU 12.04 单用户模式关机
- android api分析32 Handler Message
- "未在本地计算机上注册“OraOLEDB.Oracle.1”提供程序"解决方法
- Andriod Studio科普篇——4.关于编译的常见问题
- listview中嵌套viewpager的实现总结
- hdu-1358 period(求周期串)
- 经纬财富:苏州银价小幅上涨
- iOS - nonatomic & atomic
- 字符串过滤
- iBATIS In Action:使用高级查询技术(一)
- jquery Event target currentTarget区别
- H.264 软/硬编码器 画质量化分析评测
- 用js文件创建一个带参数的view client的快捷方式(类似的bat形式也可模仿实现),并实现自动登录
- POJ 1321 棋盘问题(简单搜索)