HDU 3746 Cyclic Nacklace 【KMP】(补充字符构成循环串)
来源:互联网 发布:阿里云2003申请入口 编辑:程序博客网 时间:2024/06/11 10:09
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3106 Accepted Submission(s): 1412
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
/*
题解:
题解:
next[]存储子串中公共前后缀的最大长度
最长循环节:cir = len - next[len]
1.字符串有多个循环节&&len!=cir 输出0
2.否则,输出:cir - (len - len/cir*cir)
*/
最长循环节:cir = len - next[len]
1.字符串有多个循环节&&len!=cir 输出0
2.否则,输出:cir - (len - len/cir*cir)
*/
#include<cstdio>#include<cstring>#define N 100002int next[N];void getnext(char *p){ int i=0,len=strlen(p); int j=next[0]=-1; while(i<len) { if(j==-1||p[i]==p[j]) { i++; j++; next[i]=j; } else j=next[j]; }}int main(){ int T,t,cir; char p[N]; scanf("%d",&T); while(T--) { scanf("%s",p); int len=strlen(p); getnext(p); cir=len-next[len];//最长循环结 if(cir!=len&&len%cir==0) printf("0\n"); else printf("%d\n",cir-len+(len/cir*cir)); } return 0;}
0 0
- 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+循环节]
- Cyclic Nacklace(HDU-3746)(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求最小循环节)
- HDU 3746 Cyclic Nacklace (kmp求循环节)
- Supervisor的安装与使用入门
- 太陽眼鏡 Sreb wNY 8UGnv
- nyoj22题
- 补上昨天的博文,Perl写音乐《午夜DJ》
- STL源码学习----lower_bound和upper_bound算法
- HDU 3746 Cyclic Nacklace 【KMP】(补充字符构成循环串)
- C++动态链接库链接错误集合
- This system is not registered with RHN. RHN support will be disabled.
- Ceph基础概述
- Android 带按钮对话框美化
- 第十四周项目4
- Monty说MySQL的优化(六)
- 修改mysql密码的几种方法
- 视频切换Jquery(动画)