poj 1961 Period(未优化KMP的next数组)
来源:互联网 发布:迅龙数据恢复软件百度 编辑:程序博客网 时间:2024/05/09 20:17
poj 1961 Period(未优化KMP的next数组)
Time Limit: 3000ms Memory Limit: 65536kB
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.
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
3
aaa
12
aabaabaabaab
0
Sample Output
Test case #1
2 2
3 3Test case #2
2 2
6 2
9 3
12 4
Source
Southeastern Europe 2004
本题复习了KMP的next[]数组求法,
使用课本里的标准程序:
void find_next(){ int i=0,j=-1; next[i]=j; while (i<l) { while ((j!=-1) && (s[i]!=s[j])) j=next[j]; i++,j++; next[i]=j;//可以优化 } return;}
Accepted 8960kB 58ms 505 B G++
#include<stdio.h>const int LEN=1000005;int l;char s[LEN];int next[LEN];void find_next(){ int i=0,j=-1; next[i]=j; while (i<l) { while ((j!=-1) && (s[i]!=s[j])) j=next[j]; i++,j++; next[i]=j; } return;}int main(){ int cases=0; while (scanf("%d\n",&l)&&l) { scanf("%s\n",s); find_next(); cases++; printf("Test case #%d\n",cases); for (int i=1;i<=l;i++) if ((next[i]!=0) && (i%(i-next[i])==0)) printf("%d %d\n",i,i/(i-next[i])); printf("\n"); } return 0;}
- poj 1961 Period(未优化KMP的next数组)
- POJ 1961 Period KMP next数组的应用
- POJ 1961 Period KMP(next数组应用)
- POJ 1961 Period(KMP next数组巧用)
- LA 3026 && POJ 1961 Period (利用kmp中的next数组找最小的循环节 )
- Poj-1961 Period(next数组应用)
- POJ 1961 KMP的next数组应用
- 1358 Period hdu kmp的next数组运用
- FZU - 1901 Period II(KMP next数组的理解)
- [kmp算法next数组的应用][poj1961]Period
- Period(kmp中next数组的运用)
- HDU 1358 Period(KMP+next数组的运用)
- HDOJ1358 Period 【KMP next数组应用】
- HDOJ1358 Period (KMP next数组应用)
- HDU - 1358 Period(KMP next数组)
- poj 1961:Period (KMP)
- poj 1961 Period (KMP)
- poj 1961 Period---kmp
- 映射篇(5.2)-03. 多宽带映射 ❀ 飞塔 (Fortinet) 防火墙
- iOS-判断是否安装某个App并从另一个App中启动该App(未安装跳转到AppStore)
- 样式化复选框(Styling Checkbox)
- android布局属性大全
- 彩色图像平滑处理
- poj 1961 Period(未优化KMP的next数组)
- HDU 2845
- 如何修改默认调试器-windbg
- mapreduce和spark的原理及区别
- hello world
- dup和dup2的使用方法
- Python 文本挖掘:jieba中文分词和词性标注
- 默认连接电脑的模式为MTP
- lua 运算符优先级