KMP（最小循环节）

最新推荐文章于 2022-02-09 15:56:37 发布

huatian5

最新推荐文章于 2022-02-09 15:56:37 发布

阅读量1.2k

点赞数 1

分类专栏：字符串处理文章标签： kmp 最小循环节问题字符串 next数组

本文链接：https://blog.csdn.net/huatian5/article/details/52187697

版权

字符串处理专栏收录该内容

22 篇文章 0 订阅

订阅专栏

HDU-3746 Cyclic Nacklace

Cyclic Nacklace

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6925 Accepted Submission(s): 3016

Problem Description

CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to tide over the last days. Being inspired by the entrepreneurial spirit of "HDU CakeMan", he wants to sell some little things to make money. Of course, this is not an easy task.

As Christmas is around the corner, Boys are busy in choosing christmas presents to send to their girlfriends. It is believed that chain bracelet is a good choice. However, Things are not always so simple, as is known to everyone, girl's fond of the colorful decoration to make bracelet appears vivid and lively, meanwhile they want to display their mature side as college students. after CC understands the girls demands, he intends to sell the chain bracelet called CharmBracelet. The CharmBracelet is made up with colorful pearls to show girls' lively, and the most important thing is that it must be connected by a cyclic chain which means the color of pearls are cyclic connected from the left to right. And the cyclic count must be more than one. If you connect the leftmost pearl and the rightmost pearl of such chain, you can make a CharmBracelet. Just like the pictrue below, this CharmBracelet's cycle is 9 and its cyclic count is 2:

Now CC has brought in some ordinary bracelet chains, he wants to buy minimum number of pearls to make CharmBracelets so that he can save more money. but when remaking the bracelet, he can only add color pearls to the left end and right end of the chain, that is to say, adding to the middle is forbidden.
CC is satisfied with his ideas and ask you for help.

Input

The first line of the input is a single integer T ( 0 < T <= 100 ) which means the number of test cases.
Each test case contains only one line describe the original ordinary chain to be remade. Each character in the string stands for one pearl and there are 26 kinds of pearls being described by 'a' ~'z' characters. The length of the string Len: ( 3 <= Len <= 100000 ).

Output

For each case, you are required to output the minimum count of pearls added to make a CharmBracelet.

Sample Input

  
  
   
   3
aaa
abca
abcde

Sample Output

让求添加几个字符可以让所给字符串变成由n个循环节组成的字符串。（n >= 2）
最小循环节问题
最小循环节 = len - next[len]

/*

*/

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 100005;
char str[N];
int Next[N];
void Getfail(int m)
{
    Next[0] = -1;
    int i = 0, j =-1;
    while(i < m)
    {
        if(j == -1 || str[i] == str[j])
        {
            i++,j++;
            Next[i] = j;
        }
        else
            j = Next[j];
    }
}

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        scanf("%s",str);
        int len = strlen(str);
        Getfail(len);

        int l = len - Next[len];//减去最大前后缀值

        if(l != len && len % l == 0)//如果自成循环
            cout<<0<<endl;
        else
            printf("%d\n",l - Next[len] % l);
    }
    return 0;
}

POJ-2406

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 1000005;
char str[N];
int Next[N],len;
void Getfail()
{
    Next[0] = -1;
    int i = 0,j = -1;
    while(i < len)
    {
        if(j == -1 || str[i] == str[j])
            Next[++i] = ++j;
        else
            j = Next[j];
    }
}
int main()
{
    while(scanf("%s",str) != EOF)
    {
        if(strcmp(str,".") == 0)
            break;
        len = strlen(str);
        Getfail();
        int l = len - Next[len];
        if(len % l == 0)
            printf("%d\n",len / l);
        else
            printf("1\n");
    }
    return  0;
}