poj 2406 Power Strings(未优化的KMP)

最新推荐文章于 2022-01-29 11:49:34 发布

pku_zzy

最新推荐文章于 2022-01-29 11:49:34 发布

阅读量816

点赞数 1

分类专栏： Algorithm

本文链接：https://blog.csdn.net/pku_zzy/article/details/52709902

版权

Algorithm 专栏收录该内容

96 篇文章 3 订阅

订阅专栏

poj 2406 Power Strings(未优化的KMP)
Time Limit: 3000ms Memory Limit: 65536kB

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

这个题本身很简单，是用来复习未优化的KMP的。
题意很清晰，想法就是计算KMP中的next[]数组，因为next[]不同规定导致下标不同，所以统一以教材版本为准：
$next[i]= max\ k:a[0,k-1]==a[i-k,i-1](i>0)\ \ \ \ or\ \ -1(i==0)$
这是不优化版本的，代码实现见下calculate_next();优化版本见课本，注意求解calculate_next()本身用了KMP算法。

Accepted    12800kB 51ms    534 B   G++

#define LEN 1000000

#include<stdio.h>
#include<string.h>

char s[LEN+1];
int next[LEN+1];
int len;

void calculate_next()
{
    int k;
    next[0]=-1;
    for (int i=1;i<=len;i++)
    {
        k=next[i-1];
        while (s[k]!=s[i-1] && k>=0)
            k=next[k];
        if (s[k]==s[i-1])
            next[i]=k+1;
        else
            next[i]=0;
    }
    return;
}

int main()
{
    while (scanf("%s\n",&s)==1)
    {
        len=strlen(s);
        if (len==1 && s[0]=='.')
            break;
        calculate_next();
        if (len%(len-next[len])==0)
            printf("%d\n",len/(len-next[len]));
        else
            printf("1\n");
    }
    return 0;
}