LA3026 - Period(KMP)
来源:互联网 发布:linux源码在线阅读 编辑:程序博客网 时间:2024/06/05 23:53
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
KMP模板题
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <string>#include <algorithm>#include <queue>#include <map>using namespace std;const int maxn = 1000000+10;int next[maxn];int n;string str;vector<int> find(string T,string P){ int n = T.size(),m = P.size(); vector<int> vn; getNext(P,next); for(int i = 0,j = 0; i < n; i++){ while(j&&P[j] != T[i]) j = next[j]; if(P[i]==T[j]) j++; if(j==m) vn.push_back(i-m+1); } return vn;}void getFail(string st,int *f){ int m = st.size(); next[0] = 0; next[1] = 0; int len = 1; for(int i = 1; i < m; i++){ int j = next[i]; while(j && st[i] != st[j]) j = next[j]; if(st[i]==st[j]){ next[i+1] = j+1; }else{ next[i+1] = 0; } }}int main(){ int T = 1; while(~scanf("%d",&n) && n){ cin >> str; printf("Test case #%d\n",T++); getFail(str,next); for(int i = 2; i <= n; i++){ if(next[i]> 0&&i%(i-next[i])==0){ cout<<i<<" "<<i/(i-next[i])<<endl; } } cout<<endl; } return 0;}
- LA3026 - Period(KMP)
- LA3026 Period [KMP]
- (LA3026) Period -- KMP again (KMP 模板)
- LA3026 Period
- LA3026 POJ1961 period 字符串周期(KMP) POJ2406 Power Strings
- KMP LA3026
- LA3026||poj1961(KMP)
- LA3026 KMP算法简单使用
- Period + KMP
- Period [KMP]
- period kmp
- Period kmp
- la3026
- LA3026 KMP 关于循环节的问题
- 1961 Period //KMP
- HDU 1358 Period (KMP)
- poj 1961:Period (KMP)
- zoj 2177 Period (KMP )
- 使用
- C# WinForm获取当前路径汇总
- 智能系统平台专业实验 人脸识别
- fastjson 的简单使用
- 设计模式 外观模式 一键电影模式
- LA3026 - Period(KMP)
- 在sql server中利用with as实现递归功能
- Linux-2.6.20的LCD驱动分析
- build android(ubuntu12.04&JDK6)
- 新手指南:Linux上vi(vim)编辑器使用教程
- C# 4.0跨程序集使用"dynamic"
- bash history command
- HTML5中div section article的区别
- Entity Framework 数据生成选项DatabaseGenerated