HDU3746 Cyclic Nacklace(KMP+最小循环节)
来源:互联网 发布:淘宝天猫苏宁易购 编辑:程序博客网 时间:2024/05/19 12:12
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8812 Accepted Submission(s): 3795
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数组然后 最小循环节长度就是 len-next[len];
#include <iostream>#include <cstring>#include<cstdio>using namespace std;char s[100005];int Next[100005];int len;void getnext(){len = strlen(s);Next[0] = Next[1] = 0;int i;for(i = 1;i<len;i++){int j = Next[i];while(j&&s[i]!=s[j])j = Next[j];Next[i+1] = s[i] ==s[j]?j+1:0;}}int main(){int n;scanf("%d",&n);while(n--){scanf("%s",s);getnext();int c = len-Next[len];if(c==1)printf("0\n");else if(c==len)printf("%d\n",len);else if(c!=len&&len%c == 0)printf("0\n");else{int num = len/c;printf("%d\n",c-(len-num*c));}}return 0;}
阅读全文
0 0
- HDU3746 Cyclic Nacklace(KMP+最小循环节)
- HDU3746 Cyclic Nacklace(KMP,最小循环节)
- D - Cyclic Nacklace HDU3746 (kmp 计算字符串最小循环节 )
- hdu3746 Cyclic Nacklace(kmp周期 最小循环节)
- [KMP求最小循环节][HDU3746][Cyclic Nacklace]
- hdu3746 Cyclic Nacklace KMP判断循环节
- hdu3746 Cyclic Nacklace(kmp找循环节)
- HDU3746 Cyclic Nacklace KMP找循环节
- hdu3746 Cyclic Nacklace (循环节)
- 【KMP】 hdu3746 Cyclic Nacklace
- HDU3746-Cyclic Nacklace(KMP)
- HDU3746 Cyclic Nacklace 【KMP】
- hdu3746 Cyclic Nacklace(KMP)
- hdu3746 Cyclic Nacklace--KMP
- HDU3746 Cyclic Nacklace(KMP)
- HDU3746--Cyclic Nacklace (Kmp)
- HDU3746 Cyclic Nacklace (KMP)
- KMP+hash hdu3746 Cyclic Nacklace
- 二重循环解题思路
- 【报错】NoSuchElementException: null
- nsq源码分析(1):代码结构
- 不定期更新--lnmp配置各种坑的笔记
- [Python]Attempted relative import in non-package
- HDU3746 Cyclic Nacklace(KMP+最小循环节)
- js查找表格自动搜索移位
- Kotlin基础教程-协程
- linux命令之----tcpdump用于截取或监视网络传输的数据包
- maven私服nexus3搭建和使用
- 更改linux终端文件夹的默认颜色
- Spring MVC redirect 参数丢失解决方案
- SpringMVC配置太多?试试SpringBoot
- 二级联动