poj 2406 Power Strings

最新推荐文章于 2022-07-21 20:55:14 发布

coding__girl

最新推荐文章于 2022-07-21 20:55:14 发布

阅读量182

点赞数

分类专栏： c++ poj KMP

本文链接：https://blog.csdn.net/coding__girl/article/details/78590820

版权

c++ 同时被 3 个专栏收录

87 篇文章

订阅专栏

poj

5 篇文章

订阅专栏

KMP

2 篇文章

订阅专栏

本文介绍如何使用KMP算法解决寻找字符串中最大相同子串的问题，通过计算next数组来确定最小循环节的长度，并给出完整的C++实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

题意：输出给定字符串最多由多少个相同的子串组成
利用KMP算法的next[]数组求最小循环节，L-next[L]即为最小循环节长度

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
const int Maxn = 1000005;
int Next[Maxn];
//int s[Maxn];
string str;
void getNext()
{
    int k=-1;
    int j=0;
    Next[0]=-1;
    while(j<str.length())
    {
        if(k==-1||str[k]==str[j])
        {
            k++;
            j++;
            Next[j]=k;
        }
        else
            k=Next[k];
    }
}
int main()
{
    int ans;
    while(cin>>str&&str!=".")
    {
        getNext();
        int l=str.length();
        if(l%(l-Next[l])==0)//l-Next[l]即最小循环节长度
        {
            ans=l/(l-Next[l]);
            cout<<ans<<endl;
        }
        else
            cout<<"1"<<endl;
    }

}