Cyclic Nacklace (kmp next数组的应用)
来源:互联网 发布:淘宝新店能开通直播吗 编辑:程序博客网 时间:2024/06/05 14:43
Cyclic Nacklace
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.
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 ).
3aaaabcaabcde
025
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int Next[100100];void getNext(char s[]){ int i = -1,j = 0; memset(Next,0,sizeof(Next)); Next[0] = -1; int lens = strlen(s); while(j < lens){ if(i==-1||s[i]==s[j]){ i++,j++; Next[j] = i;//不能优化 } else i = Next[i]; }}int main(){ int t; char s[100100]; scanf("%d",&t); while(t--){ scanf("%s",s); getNext(s); int len = strlen(s); int temp = len-Next[len];//循环节长度 if(len%temp==0&&len/temp>1)printf("0\n");//是循环的直接输出0 else{ int i; for(i = 1; ;i++){//否则判断加多少能变成循环的 if((len+i)%temp==0&&(len+i)/temp>1){ printf("%d\n",i); break; } } } } return 0;}
阅读全文
0 0
- Cyclic Nacklace (kmp next数组的应用)
- Cyclic Nacklace (kmp中next数组的运用)
- HDU Cyclic Nacklace (KMP-next数组的利用)
- Cyclic Nacklace next数组应用
- HDU-3746 Cyclic Nacklace (活用KMP中next数组)
- hdu 3746 Cyclic Nacklace(KMP中next数组的运用)
- HDU 3746 Cyclic Nacklace (next数组的应用)
- HDU 3476 Cyclic Nacklace(next数组应用)
- HDU 3746 Cyclic Nacklace 利用 KMP的next数组求循环节
- HDU--杭电--3746--Cyclic Nacklace--KMP--next值的应用
- hdu 3749 Cyclic Nacklace(kmp next数组获取循环节)
- HDU 3746 Cyclic Nacklace(Next 数组性质)
- HDU3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace KMP的性质应用
- HDU 3746 Cyclic Nacklace (next数组)
- HDU-3746 Cyclic Nacklace (对next的深入思考)
- hdu 3746 Cyclic Nacklace(KMP)
- hdu 3746 Cyclic Nacklace(KMP)
- AGC CODE FESTIVAL 2017 qual A(部分题解)
- asp.net 首页不在根目录下怎么配置
- 深度学习入门知识
- Android日记 android:contentDescription 属性
- 15.笔记JAVA Spring框架学习————通过工厂配置Bean
- Cyclic Nacklace (kmp next数组的应用)
- 顺序队列的基本操作
- 自身类作为事件监听器
- 数据的异常处理
- python2爬去多玩图库
- 计算几何 —— 模板
- 测试小故事45:学写代码
- Spring-jdbc
- android 显示当前时间(EEEE)