poj1961 KMP(循环节)
来源:互联网 发布:淘宝夜间模式 编辑:程序博客网 时间:2024/05/18 03:18
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 17696 Accepted: 8523
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
给你一个字符串,求这个字符串到第i个字符为止的循环节的次数。
比如aabaabaabaab,长度为12.到第二个a时,a出现2次,输出2.到第二个b时,aab出现了2次,输出2.到第三个b时,aab出现3次,输出3.到第四个b时,aab出现4次,输出4.
遍历一遍即可,注意理解题意
#include<cstdio>#include<cstring>using namespace std;#define EPS 1e-7#define clr(x) memset(x, 0, sizeof(x))#define long long ll#define double db#define PI acos(-1.0)const int INF = 0x3f3f3f3f;const int MOD=1000000007;const int MAXN = 1000000 + 5;const int dx[] = {1, -1, 0, 0};const int dy[] = {0, 0, 1, -1};int next[MAXN];char str[MAXN];void kmp_pre(char x[], int m){ int i = 0, j = next[0] = -1; while(i != m) { if(j == -1 || str[i] == str[j]) next[++i] = ++j; else j = next[j]; }}int main(){ int n; int cnt = 0; while(~scanf("%d", &n) && n) { scanf("%s", str); kmp_pre(str, n); printf("Test case #%d\n", ++cnt); int ans; for(int i = 1; i <= n; ++i) { ans = i - next[i]; if(i != ans && i % ans == 0) printf("%d %d\n", i, i / ans); } puts(""); } return 0;}
0 0
- poj1961 KMP(循环节)
- poj1961 KMP求循环节
- poj1961--Period(KMP求最小循环节)
- poj1961——Period(KMP循环节)
- (POJ1961)Period <KMP算法求最小循环节>
- poj1961 period KMP求循环节
- [POJ1961]Period(KMP)
- POJ1961(KMP-Next数组)
- poj1961---KMP
- POJ1961->KMP
- poj1961 & hdu 1358 Period(KMP)
- poj1961—Period(kmp周期性质)
- Poj1961 Poj2406 最短循环节
- 【KMP】 poj1961 Period
- poj1961 Period----KMP
- poj1961 kmp 重复串
- LA3026||poj1961(KMP)
- poj1961之KMP应用
- VC/MFC 获取记事本的内容
- 论文阅读 第一篇:mutual context model
- null,undefined 的区别?
- linux下的进程描述符——task_struct
- 微信小程序MD5加密接口的处理
- poj1961 KMP(循环节)
- 使用acorn对JavaScript代码进行解析。
- java学习之路之接口(4)--代理设计模式(代码)
- C# Lambda表达式
- CUDA Pro Tip:Write Flexible Kernels with Grid-Stride Loops
- Packagist 镜像使用方法
- spring mvc开发接收日期字段表单提交,自动转换成Date类型报错,解决办法
- Struts 03
- 手势锁 在本app中使用