hdu3746(KMP)

Cyclic Nacklace

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

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
  
  

 

Author

possessor WC

 

Source

HDU 3rd “Vegetable-Birds Cup” Programming Open Contest

 

Recommend

lcy

 

本题给出一个字符串，要求至少在两端添加几个字符可使该新字符串可由某一子串重复至少2次得到。

我们知道KMP算法中的next[]数组存放的是末端与开头相同的最长长度。

此题我们要求最小循环节，最小循环节=字符串长度-next[]。若字符串长度能整除最小循环节，则循环次数为字符串长度除以最小循环节；否则只能通过添加字符构成，需添加字符数为len-next[].

 

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

const int MAXN=100000+100;
int next[MAXN];
char str[MAXN];


void getNext(char *p)
{
    int j,k;
    j=0;
    k=-1;
    int len=strlen(p);
    next[0]=-1;
    while(j<len)
    {
        if(k==-1||p[j]==p[k])
        {
            j++;
            k++;
            next[j]=k;
        }
        else k=next[k];
    }
}

void solve(int len)
{
	int xh=len-next[len];
	if(xh!=len&&len%xh==0)
		printf("0\n");
	else 
		printf("%d\n",xh-next[len]%xh);
}

int main()
{
	int cas;
	cin>>cas;
	while(cas--)
	{
		scanf("%s",str);
		getNext(str);
		solve(strlen(str));
	}
	return 0;
}