poj 1961 kmp算法之next数组的意义应用
来源:互联网 发布:梦幻西游手游脚本源码 编辑:程序博客网 时间:2024/05/22 22:45
http://poj.org/problem?id=1961
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 <stdio.h>#include <string.h>const int N=1000005;int next[N],len;char a[N];void get_next(){ int i=0,j=-1; next[0]=-1; while(i<len) { if(j==-1||a[i]==a[j]) next[++i]=++j; else j=next[j]; } for(int i=2;i<=len;i++) if(i%(i-next[i])==0&&i/(i-next[i])>1) printf("%d %d\n",i,i/(i-next[i]));}int main(){ int n,t=1; while(scanf("%d",&n),n) { getchar(); scanf("%s",a); len=strlen(a); printf("Test case #%d\n",t++); get_next(); printf("\n"); } return 0;}
0 0
- poj 1961 kmp算法之next数组的意义应用
- POJ 1961 KMP的next数组应用
- POJ 2752 KMP算法中next数组的应用
- POJ 2406 KMP next数组的应用
- POJ 1961 Period KMP next数组的应用
- KMP算法中的NEXT数组的应用
- 字符串匹配的KMP算法---理解next数组的意义
- kmp算法之next数组
- poj 2406 Power Strings KMP的next数组的应用
- POJ 2185 KMP中next数组的应用
- poj 2752 kmp(next数组的应用)
- POJ 2752 KMP中next数组的应用
- poj 2406 Power Strings(kmp next数组的应用)
- KMP算法的next数组
- poj 2406 kmp算法巩固之next数组的再理解
- POJ 1961 Period KMP(next数组应用)
- poj-2406 kmp中的next数组应用
- poj 2406 kmp next数组应用
- 第五周项目1-三角形类的构造函数(4)
- my 一路向 c 之rand
- Eclipse远程调试hadoop源码
- ubuntu编译linux内核出现 Unable to find the ncurses libraries or the required header files.
- Android
- poj 1961 kmp算法之next数组的意义应用
- 《火鸡总动员》观后感
- MH370 的伤痛
- 背景建模SACON
- 链表相关的算法题大汇总 — 数据结构之链表奇思妙想
- Javascript 浮点运算问题分析与解决
- linux下安装protobuf及常见错误
- C++ iterator用法
- UPC:2536 Changlong(二进制技巧)