LA3026 - Period(KMP)

最新推荐文章于 2019-05-11 16:05:27 发布

原创最新推荐文章于 2019-05-11 16:05:27 发布 · 1.1k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

KMP 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种算法，用于检测给定字符串的所有前缀是否为周期性的，并确定其周期长度。通过KMP算法实现，适用于字符串匹配问题。

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

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;
}