【hdu1358】Period——KMP
来源:互联网 发布:极速法术升级数据 编辑:程序博客网 时间:2024/06/02 03:32
题目:
Period
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5732 Accepted Submission(s): 2766
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
描述:给定一个长度为N的字符串S,对于每一个长度为i(2~N)的前缀,求这个前缀中的循环节个数及长度,如果有则输出前缀的长度及个数
题解:KMP算法中next数组的应用,长度为i的前缀,若i能被(i-nxt[i])整除,则表示有循环节,长度即为i-nxt[i],要注意i-nxt[i]!=0.
代码:
#include <cstdio>#include <cstring>#include <algorithm>#include <cstdlib>using namespace std;const int maxn = 1e6;char text[maxn];int nxt[maxn];int main(){//freopen("input.txt", "r", stdin);int cnt = 1;int n;while (scanf("%d", &n), n != 0){scanf("%s", text);for (int i = 0, j = -1; i <= n; i++, j++){nxt[i] = j;while (~j && text[i] != text[j])j = nxt[j];}printf("Test case #%d\n", cnt++);for (int i = 1; i <= n; i++){if (i != i - nxt[i] && i % (i - nxt[i]) == 0)printf("%d %d\n", i, i / (i - nxt[i]));//printf("%d\n", nxt[i]);}printf("\n");}return 0;}
0 0
- 【hdu1358】Period——KMP
- ACM-KMP之Period——hdu1358
- hdu1358——Period
- Period hdu1358 KMP
- hdu1358 period ,Kmp
- hdu1358 Period kmp+模拟
- hdu1358 Period(kmp)
- HDU1358 Period【KMP】
- hdu1358 Period(kmp周期)
- hdu1358 Period--KMP
- HDU1358 Period(KMP)
- HDU1358-Period(KMP)
- HDU1358 Period(KMP)
- HDU1358:Period KMP跳转数组
- hdu1358—Period(循环串)
- HDU1358 Period KMP循环节问题
- [KMP求最小循环节][HDU1358][Period]
- HDU1358 Period(KMP找循环前缀)
- 游戏引擎架构选摘之第五章 游戏支持系统
- 入门Android开发--第一行代码--笔记系列(Intent)
- 没事写个冒泡排序
- Windows 系统安装 Apache 服务器
- 共同学习Java源码--常用数据类型--String(十六)
- 【hdu1358】Period——KMP
- java学习笔记(从搭建环境到入门java)
- 一些Java中常用的定义(2)
- 记一次折腾之旅(兼 Classias 安装教程)
- Android API Guides---Toggle Buttons
- Oracle数据库--实用操作(6)触发器
- java枚举使用详解
- 谈谈你对面向对象的理解
- PHP编译执行Java源文件并重定向输出