首页 > 代码库 > hdoj 3746 Cyclic Nacklace

hdoj 3746 Cyclic Nacklace

2024-11-21 11:15:02   202人阅读

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
 

//给你一个字符串，
//要求将字符串的全部字符最少循环2次需要添加的字符数

例如：abca       abcabc 然后首尾相连

AC代码如下：
 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <stdlib.h>
 4 #define MAX 100010
 5 char str1[MAX];
 6 int next[MAX];
 7 void getnext(char b[MAX],int m)
 8 {
 9    int i=0,j=-1;
10    next[i]=-1;
11    while(i<m)
12    {
13       if(j==-1||b[j]==b[i])
14       {i++;
15        j++;
16        next[i]=j;
17         }
18       else
19         j=next[j];
20     }
21 }
22 int main()
23 {
24     int len,t;
25     int l;
26     scanf("%d",&t);
27     while(t--)
28     {
29        memset(next,0,sizeof(next));
30         scanf("%s",str1);
31         len=strlen(str1);
32         getnext(str1,len);
33         l=len-next[len];
34         if(len==l)
35                 printf("%d\n",len);
36         else
37            { if(len%l==0)
38                 printf("0\n");
39              else
40                 printf("%d\n",l-len%l);
41            }
42     }
43        return 0;
44 }

 

 1     #include<iostream>
 2     #include<cstring>
 3     #include<cstdio>
 4     #include<algorithm>
 5     using namespace std;
 6     #define N 100010
 7 
 8     char s[N];
 9     int nextval[N];
10     int len;
11 
12     void getnext(const char *s)
13     {
14         int i = 0, j = -1;
15         nextval[0] = -1;
16         while(i != len)
17         {
18             if(j == -1 || s[i] == s[j])
19                 nextval[++i] = ++j;
20             else
21                 j = nextval[j];
22         }
23     }
24 
25     int main()
26     {
27         int ncase;
28         int length, add;
29         scanf("%d", &ncase);
30         while(ncase--)
31         {
32             scanf("%s", s);
33             len = strlen(s);
34             getnext(s);
35             for(int i = 0; i <= len; ++i) //查看next数组的内容
36             cout<<nextval[i]<<" ";
37             cout<<endl;
38             length = len - nextval[len]; //循环节的长度
39             if(len != length && len % length == 0) //循环多次
40                 printf("0\n");
41             else
42             {
43                 add = length - nextval[len] % length; //取余的作用：abcab，去掉abc
44                 printf("%d\n",add);
45             }
46         }
47         return 0;
48     }

 

hdoj 3746 Cyclic Nacklace


联系
我们