HDU3746（KMP求循环节）

最新推荐文章于 2019-10-14 12:31:02 发布

原创最新推荐文章于 2019-10-14 12:31:02 发布 · 337 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#题解

逝去的ACM经历专栏收录该内容

22 篇文章

订阅专栏

本文介绍了一种名为Cyclic Necklace的问题解决方法，该问题要求在已有链的基础上最少添加多少颗珍珠形成可循环连接的装饰手链。通过使用KMP算法预处理字符串来找到最小重复周期，进而计算出所需的额外珍珠数量。

Cyclic Nacklace

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

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

之前写过一篇关于循环节的KMP知识，这道题其实就是模板题。

代码：

#include<cstdio>
#include<cstring>
using namespace std;

#define EPS 1e-7
#define clr(x) memset(x, 0, sizeof(x))
#define long long ll
#define double db
#define PI acos(-1.0)

const int INF = 0x3f3f3f3f;
const int MOD=1000000007;
const int MAXN = 1000000 + 5;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int next[MAXN];
char str[MAXN];
void kmp_pre(char x[], int m)
{
    int i = 0, j = next[0] = -1;
    while(i != m)
    {
        if(j == -1 || str[i] == str[j])
            next[++i] = ++j;
        else
            j = next[j];
    }
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%s", str);
        int n = strlen(str);
        kmp_pre(str, n);
        int ans;
        ans = n - next[n];
        if(n != ans && n % ans == 0)
            puts("0");
        else
            printf("%d\n", ans - next[n] % ans);
    }
    return 0;
}