HDU 1358 Peroid(KMP和循环节)
来源:互联网 发布:3dmax软件下载 编辑:程序博客网 时间:2024/05/19 18:45
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 A K , 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
题意:看前I个字母是不是完整的循环字符串并输出i和循环次数
做法:求出Next数组,对每个位置求周期,如果i|(i-next[i])就输出就可以了
#include <string.h>#include <iostream>#include <cstdio>#define maxn 1000010int next[maxn];void getNext(char* P, int* f){ int m = strlen(P); f[0] = 0; f[1] = 0; for(int i = 1; i < m; i++) { int j = f[i]; while(j && P[i] != P[j]) { j = f[j]; } f[i + 1]=P[i]==P[j]?j+1:0; }}int kmp(char* T, char*P, int*f){ int n = strlen(T), m = strlen(P); getNext(P, f); int j = 0; for(int i = 0; i < n; i++) { while(j && P[j] != T[i]) { j = f[j]; } if(P[j] == T[i]) { j++; } if(j == m) { return 1;//i-m+1 } } return 0;}int main(){ char s1[maxn]; char s2[maxn]; int a; int n; int m; int ca=1; while(scanf("%d",&n)==1) { if(n==0)break; printf("Test case #%d\n",ca++); scanf("%s",s1); getNext(s1,next); int tmp=0; for(int i=1;i<=n;i++) { tmp=i-next[i]; if(i%tmp==0&&i/tmp!=1) { printf("%d %d\n",i,i/tmp); } } printf("\n"); } return 0;}
- HDU 1358 Peroid(KMP和循环节)
- hdu 1358 KMP循环节
- [KMP-循环节问题]HDU 1358 period
- hdu 1358 period 求循环节 KMP
- hdu 1358 Period(KMP 循环节)
- HDU 1358 Period(kmp循环节)
- hdu 1358 Period(KMP循环节)
- HDU 1358 Period [KMP+循环节]
- HDU-1358 Period(KMP求循环节)
- hdu 1358 kmp 求循环节
- hdu 1358 Period(KMP循环)
- HDU 3746 kmp循环节
- HDU 3746 Cyclic Nacklace (KMP和循环节)
- HDU 1358 Period (kmp求循环节)
- KMP + 求最小循环节 --- HDU 1358 Period
- HDU 1358 Period (next跳表找最小循环节)KMP
- HDU 1358 KMP运用 求某串中所有循环前缀串的长度和循环次数
- hdu 1358 Period【KMP字符串循环】
- listview侧滑删除
- iOS关于图片问题的警告
- Django中如何完成easyUI 表格数据的增删改?
- Nutch 2.2.1+MySQL+Solr4.2实现网站内容的抓取和索引
- 【Hibernate】对象的状态
- HDU 1358 Peroid(KMP和循环节)
- 学习阶段总结(1)
- 通过java客户端给K8s节点机打标签
- 通过getIdentifier获取资源id
- JSONObject,JSONArray,Map,String之间转换
- 关于redis启动时报错:Could not get a resource from the pool。
- 英语666
- 隐马尔科夫模型 HMM 与 语音识别 speech recognition (1):名词解释
- 修改etc/sudoers,导致系统出现sudo错误