HDU-3746 Cyclic Nacklace(KMP求循环)
来源:互联网 发布:什么叫大数据 编辑:程序博客网 时间:2024/05/29 14:30
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10034 Accepted Submission(s): 4292
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.
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 ).
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
3aaaabcaabcde
Sample Output
025
#include<bits/stdc++.h>using namespace std;const int maxn =1e6+10;char a[maxn];int f[maxn];void kmp_pre(char x[],int m,int next[]){ int i,j; j=next[0]=-1; i=0; while(i<m){ while(-1!=j&&x[i]!=x[j])j=next[j]; next[++i]=++j; }}int main(){ int T; scanf("%d",&T); while(T--) { scanf("%s",a); memset(f,0,sizeof(f)); int len=strlen(a); kmp_pre(a,len,f); int temp=len-f[len]; ///最小循环节 if(len%temp==0){ ///其本身就是一个循环节, 或者串长是循环节的整数倍(整数大于1) if(len/temp>1)printf("0\n"); ///串长是循环节的整数倍(整数大于1) else printf("%d\n",len);///其本身就是一个循环节 } else printf("%d\n",temp-(len-(len/temp*temp))); }}
阅读全文
1 0
- HDU - 3746 Cyclic Nacklace (KMP求循环节)
- HDU 3746 Cyclic Nacklace (KMP求循环结)
- hdu 3746 Cyclic Nacklace (kmp求最小循环节)
- HDU 3746 Cyclic Nacklace (kmp求循环节)
- HDU-3746 Cyclic Nacklace(KMP求循环)
- [KMP-求循环节]HDU 3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace(KMP求最小循环元)
- hdu 3746 Cyclic Nacklace (KMP求最小循环节)
- hdu 3746 Cyclic Nacklace(KMP求循环节)
- HDU 3746 Cyclic Nacklace(kmp求循环节)
- HDU-3746-Cyclic Nacklace【KMP求循环节】【经典题】
- 【hdu 3746】 Cyclic Nacklace KMP求循环节
- HDU 3746 Cyclic Nacklace (KMP 循环节)
- 【kmp循环节】hdu 3746 Cyclic Nacklace
- HDU - 3746 Cyclic Nacklace(KMP 循环节)
- HDU 3746 Cyclic Nacklace [KMP+循环节]
- [HDU 3746]Cyclic Nacklace[kmp求周期]
- Cyclic Nacklace(HDU-3746)(KMP循环节)
- sed -- 流式编辑器
- SQL 基础语句应用
- android报错Circular dependencies cannot exist in RelativeLayout
- Request header filed is missing ':'separator
- python条件表达式即三元运算符写法
- HDU-3746 Cyclic Nacklace(KMP求循环)
- SpringBoot,发送到邮箱
- springboot文件上传下载
- 常用求逆元的方法
- Android Java 层的同步机制
- nyist 325 (zb的生日)
- KMP算法入门详解
- 阻塞与非阻塞,同步与异步
- 赶吃花的牛 USACO