HDU1358kmp求循环串
来源:互联网 发布:电气控制仿真软件exe 编辑:程序博客网 时间:2024/05/01 23:52
Period
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2788 Accepted Submission(s): 1386
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
#define DeBUG#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <algorithm>#include <vector>#include <stack>#include <queue>#include <string>#include <set>#include <sstream>#include <map>#include <list>#include <bitset>using namespace std ;#define zero {0}#define INF 0x3f3f3f3f#define EPS 1e-6typedef long long LL;const double PI = acos(-1.0);//#pragma comment(linker, "/STACK:102400000,102400000")inline int sgn(double x){ return fabs(x) < EPS ? 0 : (x < 0 ? -1 : 1);}#define N 1000002int next[N];int n;char a[N];void get_next(){ int i = 1, j = 0; next[1] = 0; while (i <= n) { if (j == 0 || a[i] == a[j]) { i++; j++; next[i] = j; } else j = next[j]; }}int cnt = 1;int main(){#ifdef DeBUGs freopen("C:\\Users\\Sky\\Desktop\\1.in", "r", stdin);#endif while (scanf("%d", &n), n) { memset(next, 0, sizeof(next)); scanf("%s", a + 1); get_next(); for (int i = 1; i <= n + 1; i++) { printf("%d ", next[i]); } printf("\n"); printf("Test case #%d\n", cnt++); int k; for (int i = 2; i <= n; i++) { k = i - (next[i + 1] - 1);//这里是关键 if (i != k && i % k == 0) printf("%d %d\n", i, i / k); } printf("\n"); } return 0;}
0 0
- HDU1358kmp求循环串
- hdu1358kmp串循环节
- hdu1358KMP
- 循环矩阵求幂
- 循环求n!
- 11.求循环节
- 求循环素数
- 用循环求
- 用循环求
- 用循环求
- 用循环求
- 用循环求
- 求循环数和
- 求循环节
- poj2406--Power Strings(kmp:求循环串的次数)
- 51nod 求循环数组的最大子串和
- 1961 2406 poj 求字符串的最小循环子串
- 数据结构:KMP next数组求串最小循环节、循环周期
- uva11754 - Code Feat 枚举 中国剩余定理
- SpringMVC JQuery Ajax Get Post请求在Tomcat中乱码解决方案
- HDU 1214圆桌会议
- HDOJ 1753 大明A+B
- 在Android模拟器里安装apk
- HDU1358kmp求循环串
- Notepad++ 正则表达式使用
- char s[]和char *s的区别
- 设计模式之十三:Flyweight(享元)—对象结构型模式
- [BZOJ 1003][ZJOI2006]物流运输trans
- httpd: Could not reliably determine the server's fully qualified domain name
- 华为测试 挑七
- python核心编程(二)第二章答案(自己写,可能与标准答案有些出入)
- 写给年轻程序员的一些建议