HDU 3746 kmp循环节
来源:互联网 发布:财新主持人袁小珊 知乎 编辑:程序博客网 时间:2024/05/21 06:53
题目链接:
[kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher D - Cyclic Nacklace
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
循环节问题:循环节大小 = len- nxt[len-1];
坑,莫名奇妙Wrong,wrong,wrong!!!!!,删了重写才A的
/************************************************************************* > File Name: hdu_3746_kmp求循环节.cpp > Author: dulun > Mail: dulun@xiyoulinux.org > Created Time: 2016年03月14日 星期一 14时37分08秒 ************************************************************************/#include<iostream>#include<stdio.h>#include<cstring>#include<cstdlib>#include<algorithm>#define LL long longusing namespace std;const int N = 100009;char a[N];int nxt[N];void getnxt(){ memset(nxt, 0, sizeof(nxt)); int k = 0; int len = strlen(a); for(int i = 1; i < len; i++) { while(k && a[k] != a[i]) k = nxt[k-1]; if(a[k] == a[i]) k++; nxt[i] = k; }}int main(){ int T; scanf("%d", &T); while(T--) { scanf("%s", a); getnxt(); int l = strlen(a); int xun = l - nxt[l-1]; if(nxt[l-1] == 0) printf("%d\n", l); else if(l % xun == 0) printf("0\n"); else { printf("%d\n", xun - l % xun); } } return 0;}
- HDU 3746 kmp循环节
- hdu 3746(KMP) 最小循环节
- HDU 3746利用KMP找循环节
- HDU 3746 Cyclic Nacklace (KMP 循环节)
- HDU 3746 KMP求循环节
- 【kmp循环节】hdu 3746 Cyclic Nacklace
- HDU - 3746 Cyclic Nacklace(KMP 循环节)
- hdu 3746 kmp求字符串循环节
- HDU 3746 Cyclic Nacklace [KMP+循环节]
- KMP之循环节 hdu 3746
- hdu 3746 kmp求最小循环节
- hdu 1358 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 最小循环节)
- 【KMP(循环节)】hdu 3746 Cyclic Nacklace
- Eclipse配置Tomcat
- java(优化七) 15天玩转redis之第一篇
- 使用android-async-http来封装Android网络请求框架
- 左移右移运算符的探究
- Android SettingProvider详解
- HDU 3746 kmp循环节
- cocoapods一直卡在 Updating local specs repositories
- VS 编译PCL后 install报错
- ContextMenu的简单使用
- nomn监控指标介绍
- js通用对象数组冒牌排序
- android APP 中微信分享功能实现 的总结
- 内存的管理方式有哪些
- nginx配置