HDU 3746 Cyclic Nacklace (最小循环节、循环周期)

HDU 3746 Cyclic Nacklace (最小循环节、循环周期)

-012
传送门：http://acm.hdu.edu.cn/showproblem.php?pid=3746

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
0
2
5

题意：给你一个字符串，让你求得这个字符串是不是可以循环n次，如果不是的话你可以在其左右两侧加入字母，问最少加入多少个字符可以使其构成一个循环的序列。
思路：直接使用KMP得到next数组，然后你会得到一个神奇的定理！！！

定理：假设S的长度为len，则S存在最小循环节，循环节的长度L为len-next[len]，子串为S[0…len-next[len]-1]。
(1)如果len可以被len - next[len]整除，则表明字符串S可以完全由循环节循环组成，循环周期T=len/L。
(2)如果不能，说明还需要再添加几个字母才能补全。需要补的个数是循环个数L-len%L=L-(len-L)%L=L-next[len]%L， L=len-next[len]。

再来个传送门：GO！！！KMP最小循环节、循环周期

最后来一个AC代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <vector>
#include <set>
#include <string>
#include <math.h>

using namespace std;
typedef long long ll;

const int maxn = 1e5+10;
char p[maxn];
int nex[maxn];

void getnex()
{
    int len = strlen(p);
    nex[0] = -1;
    int j = 0, k= -1;

    while(j < len)
    {
        if(k== -1 || p[k] == p[j])
            nex[++j] = ++k;
        else
            k=nex[k];
    }
}

int main()
{
    int tt;
    scanf("%d", &tt);
    while(tt--)
    {
        scanf("%s", p);
        getnex();
        int len = strlen(p);
        int L = len-nex[len];

        if(len % L == 0 && L != len)
            puts("0");
        else
            printf("%d\n", L-len%L);
    }
    return 0;
}

/*
定理：假设S的长度为len，则S存在最小循环节，循环节的长度L为len-next[len]，子串为S[0…len-next[len]-1]。
（1）如果len可以被len - next[len]整除，则表明字符串S可以完全由循环节循环组成，循环周期T=len/L。
（2）如果不能，说明还需要再添加几个字母才能补全。需要补的个数是循环个数L-len%L=L-(len-L)%L=L-next[len]%L，	L=len-next[len]。
*/

orz
next数组的含义：next[i]表示前面长度为i的子串中，前缀和后缀相等的最大长度。