HDU 3746 KMP求循环节
来源:互联网 发布:淘宝修改店铺最低折扣 编辑:程序博客网 时间:2024/06/05 10:07
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4356 Accepted Submission(s): 1977
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
考察循环节,需要对于kmp求出的p数组好好琢磨,如果p[i]!=0,那么t= i-p[i]即为此时的长度节,如果i%t == 0,那么就刚好是循环节。
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>//#define LOCALusing namespace std;char a[100010];char b[100010];int p[100010];int len;void kmp(char* a){ p[0] = p[1] = 0; int i,j; for(i = 1;i<len;i++){ j = p[i]; while(j&&a[i]!=a[j]) j = p[j]; p[i+1] = a[i] == a[j]?j+1:0; }}int main(){#ifdef LOCAL freopen("data.in","r",stdin);#endif // LOCAL int N; scanf("%d",&N); while(N--){ scanf("%s",a); len = strlen(a); kmp(a); int k = len - p[len]; if(p[len] == 0) printf("%d\n",len); else if(len%k == 0) printf("0\n"); else printf("%d\n",k - len%k); } return 0;}
- HDU 3746 KMP求循环节
- hdu 3746 kmp求字符串循环节
- hdu 3746 kmp求最小循环节
- [KMP-求循环节]HDU 3746 Cyclic Nacklace
- hdu 3746 kmp求循环节 下标从1开始
- 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求循环节
- hdu 3746 kmp next求最小循环节
- hdu 1358 period 求循环节 KMP
- HDU-1358 Period(KMP求循环节)
- hdu 1358 kmp 求循环节
- HDU 3746 kmp循环节
- Makefile中eval函数用法
- HDU 1568 Fibonacci(数学 递推式)
- 在Eclipse中搭建Dagger和Dagger2使用环境
- Bean的作用域及生命周期
- hibernate设计一棵普通的树
- HDU 3746 KMP求循环节
- Nginx基础知识. Nginx网络属性
- Java基础--------集合
- I-- ytaaa(FZU--2177
- Java的异常和错误
- 剑指offer面试题13-在O(1)时间删除链表的节点
- CodeForces 453A 概率题
- Gtk与Qt编译环境安装与配置
- 归并排序(C/C++)