POJ 1961 Period (KMP)

原创 2016年08月28日 15:08:04
Period
Time Limit: 3000MS   Memory Limit: 30000K
Total Submissions: 16635   Accepted: 7999

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

题意:给定一个字符串,问这个字符串的所有前缀中,有哪些前缀可以由某个串重复k次组成,并且这个k最大是多少。这个k需要大于1。
分析:对next数组的一种应用;next数组其实保存的就是字符串的相似度;保存的是其前一个字符的前缀和后缀相等的最大值,假如next[i]的值为6,那么它的前一个字符前缀和后缀最多就有6个相等;
字符的编号从0开始,这里面就可以推出一个规律;那么if(i%(i-next[i])==0),则i前面的串为一个轮回串,其中轮回子串出现i/(i-next[i])次。
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1000000 + 10;
char str[maxn];
int next[maxn];
int len;
int cas;
int n;

void getNext()
{
    int i = 0, j = -1;
    next[0] = -1;
    while (i != len){
        if (j == -1 || str[i] == str[j]){
            next[++i] = ++j;
        }
        else
            j = next[j];
    }
}

int main()
{
    cas = 0;
    while (scanf("%d", &len), len){
        scanf("%s", str);
        printf("Test case #%d\n", ++cas);
        getNext();
        for (int i = 2; i <= len; i++){
            if (i % (i - next[i]) == 0 && i / (i - next[i]) != 1){
                printf("%d %d\n", i, i / (i - next[i]));
            }
        }
        printf("\n");
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

Kmp找字符串循环节——Period ( POJ 1961 )

题目链接: http://poj.org/problem?id=1961 分析: 给出一个字符串长度为N,从左变开始取2~N个字符出来构成一个新字符串,若新字符串能被一个最短的循环节构成则输出新字...
  • FeBr2
  • FeBr2
  • 2016-07-15 15:09
  • 713

Period POJ - 1961(kmp求最大周期,最小循环节)

For each prefix of a given string S with N characters (each character has an ASCII code between 97 a...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

【KMP】 poj1961 Period

Period http://poj.org/problem?id=1961 Description For each prefix of a given string S wit...

POJ_1961_Period_KMP

最近母校试点开

Period (poj 1961&&hdu 1358)KMP

题意:求长度为i(2<=i<=N)的前缀,若前缀是一个周期串,则输出长度i和它的最大周期;要找出所有满足条件的。 思路:next[i]数组里面存的是i位置前 字符串的相同前缀和后缀的最大长度,若它是一...

POJ 1961 Period(KMP)

题目连接:点我 For each prefix of a given string S with N characters (each character has an ASCII code betw...

POJ 1961 Period KMP 最小循环节

Period Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 11771   Accept...

LA 3026 && POJ 1961 Period(KMP求前缀的最短循环节)

题意: 给定一个长度为n 的字符串s,求它的每个前缀的最短循环节? 思路: 我们想一下KMP的next 函数。 next[i]表示 由S[0],S[1],,,,S[i] 构成的字符串的最大前缀...

POJ-1961 Period-KMP前缀串重复次数

Period Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 14803   Accepted: 7054 ...

poj1961 Period(KMP)

C - Period Crawling in process... Crawling failed Time Limit:3000MS     Memory Limit:30000KB    ...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)