hdu3746 Cyclic Nacklace【nxt数组应用】【最小循环节】

Cyclic Nacklace

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

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

 

题意：

找一个字符串的最小循环节。问最后不构成循环节的那段要加多少个字符才能构成循环节。

思路：

一个字符串的最小循环节为$len-nxt[len]$

【见http://www.cnblogs.com/wuyiqi/archive/2012/01/06/2314078.html】

分三种情况：1、如果$nxt[len]$为$0$，输出$len$。 2、如果$len$整除循环节，输出为$0$。 3、否则输出为$len-nxt[len]-len%(len-nxt[len])$

【题目necklace拼错了吧....】

 #include<iostream>
 #include<bits/stdc++.h>
 #include<cstdio>
 #include<cmath>
 //#include<cstdlib>
 #include<cstring>
 #include<algorithm>
 #include<queue>
 #include<vector>
 //#include<set>
 //#include<climits>
 //#include<map>
 using namespace std;
 typedef long long LL;
 typedef unsigned long long ull;
 #define pi 3.1415926535
 #define inf 0x3f3f3f3f

 const int maxn = 1e5 + ;
 int n, t;
 char str[maxn];
 int nxt[maxn];

 void getnxt(char *s)
 {
     int len = strlen(s);
     nxt[] = -;
     int k = -;
     int j = ;
     while(j < len){
         if(k == - || s[j] == s[k]){
             ++k;++j;
             if(s[j] != s[k]){
                 nxt[j] = k;
             }
             else{
                 nxt[j] = nxt[k];
             }
         }
         else{
             k = nxt[k];
         }
     }
 }

 int main()
 {
     scanf("%d", &t);
     while(t--){
         memset(nxt, , sizeof(nxt));
         scanf("%s", str);
         int len = strlen(str);
         getnxt(str);

         if(nxt[len] == ){
             printf("%d\n", len);
         }
         else{
             int ans = len - nxt[len];
             if(len % ans == ){
                 printf("0\n");
             }
             else{
                 printf("%d\n", ans - len % ans);
             }
         }
     }
     return ;
 }