hdu 1358 Period(next数组的理解)
来源:互联网 发布:java数组学生管理系统 编辑:程序博客网 时间:2024/06/01 08:54
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
3
aaa
12
aabaabaabaab
0
Sample Output
Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
12 4
题目大意:
一个字符串,从头到某个位置,字符串的前缀最多重复了多少次
解法:
判断循环节
#include<iostream>#include<cstdio>#include<cstring>using namespace std;char s[1000005];int n,nxt[1000005];void getNext(){ nxt[0]=nxt[1]=0; int i=1,j=0; while(i<=n) { if(j==0||s[i]==s[j]) nxt[++i]=++j; else j=nxt[j]; }}int main(){ int t=1; while(scanf("%d",&n)&&n) { scanf("%s",s+1); getNext(); printf("Test case #%d\n",t++);// for(int i=1;i<=n+1;i++)// printf("%d ",nxt[i]);// printf("\n"); for(int i=2;i<=n;i++) { int k=i-(nxt[i+1]-1); //k表示长度// printf("%d\n",k); if(i!=k&&i%k==0) //这里注意理解 printf("%d %d\n",i,i/k); } printf("\n"); } return 0;}
- hdu 1358 Period(next数组的理解)
- HDU 1358 Period(KMP+next数组的运用)
- 1358 Period hdu kmp的next数组运用
- HDU 1358 Period(next数组+周期+循环节)
- hdu 1358 Period(KMP之next数组)
- HDu 1358 Period(Next 数组找循环节)
- 【next数组应用】HDU 1358 Period
- HDU - 1358 Period(KMP next数组)
- FZU - 1901 Period II(KMP next数组的理解)
- HDU--杭电--1358--Period--KMP--next值的应用
- Period(kmp中next数组的运用)
- HDOJ 1358 Period(KMP next数组运用)
- HDU 1358 Period (next跳表找最小循环节)KMP
- Poj-1961 Period(next数组应用)
- HDOJ1358 Period (KMP next数组应用)
- Period +uvalive+next数组
- Period next数组应用
- 【kmp算法next数组-串的最小循环节/循环周期】Period HDU
- MinGW下载并配置gcc\g++编译环境
- OnNewDocument 不自动调用,必须要我点击菜单->新建的时候再调用,如何做?
- hdu 4300 Clairewd’s message(KMP)
- 自己做IE各个版本兼容的时候用的解决办法方法,IE6到IE11都可以【亲测】
- CString和WCHAR数组相加出现了问题,请各位回答一下,谢谢!
- hdu 1358 Period(next数组的理解)
- Wince系统程序-数组内存分配
- fedora Chrome出现adobe flash is out of date的解决方法
- c++中vector问题
- Android拨打电话等功能实现及其延伸
- MFC 启动exe 参数传递
- 多线程操作全局变量的问题(有点复杂,需要考虑线程的优先级问题)
- hdu 2594 Simpsons' Hidden Talents(KMP)
- Docker学习总结之Run命令介绍