POJ 2752 (KMP)

最新推荐文章于 2016-05-11 20:00:02 发布

morejarphone

最新推荐文章于 2016-05-11 20:00:02 发布

阅读量253

点赞数

分类专栏： KMP

本文链接：https://blog.csdn.net/morejarphone/article/details/51357395

版权

KMP 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 41709		Accepted: 17343

Description

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).

Input

Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.

Output

For each s you should print the largest n such that s = a^n for some string a.

Sample Input

abcd
aaaa
ababab
.

Sample Output

1
4
3

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

Source

Waterloo local 2002.07.01

题意：求一个串中所有的既是前缀串又是后缀串的前缀串。

根据next数组的含义，从后往前遍历一次next数组就好了。

#include <cstring>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
#define maxn 411111

char T[maxn];
int n;
#define next Next
int next[maxn];
vector <int> ans;

void get_next (char *p) {  
    int m = strlen (p);
    int t;  
    t = next[0] = -1;  
    int j = 0;  
    while (j < m) {  
        if (t < 0 || p[j] == p[t]) {//匹配  
            j++, t++;  
            next[j] = t;
        }  
        else //失配  
            t = next[t];  
    } 
}  

int main () {
    while (scanf ("%s", T) == 1) {
        n = strlen (T);
        get_next (T); 
        ans.clear ();
        int j = n;
        while (next[j] >= 1) {
            ans.push_back (next[j]);
            j = next[j];
        }
        sort (ans.begin (), ans.end ());
        for (int i = 0; i < ans.size (); i++) {
            printf ("%d ", ans[i]);
        }
        printf ("%d\n", n);
    }
    return 0;
}