【KMP】 hdu3746 kmp求循环节长度
来源:互联网 发布:自由职业贷款软件 编辑:程序博客网 时间:2024/05/18 03:47
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7605 Accepted Submission(s): 3292
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<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<algorithm>using namespace std;const int maxn=100010;char P[maxn];int nextt[maxn],len;void setnext(char *P,int *nextt){ nextt[0]=0; for(int i=1; i<len; i++) { int k=nextt[i-1]; while(P[i]!=P[k]&&k!=0) { k=nextt[k-1]; } if(P[i]==P[k]) nextt[i]=k+1; else nextt[i]=0; }}int main(){ int n; scanf("%d",&n); while(n--) { scanf("%s",P); len=strlen(P); setnext(P,nextt);// for(int i=0; i<len; i++) //输出next数组值;// printf("%d ",nextt[i]);// printf("\n"); int length=len-nextt[len-1];//循环节长度;// printf("%d\n",length); if(len%length==0&&len!=length) printf("0\n"); else printf("%d\n",length-nextt[len-1]%length); } return 0;}
0 1
- 【KMP】 hdu3746 kmp求循环节长度
- HDU3746(KMP求循环节)
- HDU3746-KMP循环节
- 【KMP】【HDU3746】【最小循环节】
- HDU3746--KMP+最小循环节
- [KMP求最小循环节][HDU3746][Cyclic Nacklace]
- hdu3746 利用KMP找循环节
- hdu3746 Cyclic Nacklace KMP判断循环节
- hdu3746 Cyclic Nacklace(kmp找循环节)
- HDU3746 Cyclic Nacklace KMP找循环节
- HDU3746 Cyclic Nacklace(KMP+最小循环节)
- HDU3746 Cyclic Nacklace(KMP,最小循环节)
- UVA455 KMP求最小循环节长度
- hdu3746(KMP)
- hdu3746 KMP
- D - Cyclic Nacklace HDU3746 (kmp 计算字符串最小循环节 )
- hdu3746 Cyclic Nacklace(kmp周期 最小循环节)
- hdu3746 KMP的next数组应用,求项链首尾项链循环
- 关于ajax提交表单,重复提交解决方法
- 设计模式之单例模式
- 阅读图像显著性检测论文一:A Model of Saliency-Based Visual Attention for Rapid Scene Analysis
- HIVE精华汇总帖
- perl 导出函数到当前名字空间
- 【KMP】 hdu3746 kmp求循环节长度
- Android--Utils
- 二叉排序树各项操作
- HttpClient已过时,访问网络用HttpURLConnection
- golang---redis入门
- android6.0的坑
- SQLserver学习day06 T-SQL程序
- 安卓5.0以上系统无法调用WebService问题
- imge stitching图像拼接stitching