HDU3746 Cyclic Nacklace(KMP)
来源:互联网 发布:excel数据验证自定义 编辑:程序博客网 时间:2024/05/06 18:45
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7266 Accepted Submission(s): 3166
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
Author
possessor WC
Source
HDU 3rd “Vegetable-Birds Cup” Programming Open Contest
http://acm.split.hdu.edu.cn/showproblem.php?pid=3746
题意 一个给出的字符串 求最少加几个字符可以使它变成循环的(周期>=2)
求出next数组 求出整个字符串的最短循环节 然后......
#include<bits/stdc++.h>using namespace std;#define maxx 200010int f[maxx];char p[maxx];int main(){ int t,i,n,sum,u,j; scanf("%d",&t); while(t--) { scanf("%s",p); n=strlen(p); f[1]=0,f[0]=0; for(i=1; i<n; i++) { j=f[i]; while(j&&p[i]!=p[j]) j=f[j]; f[i+1]= p[i] == p[j]?j+1:0; } if(!f[n]) {printf("%d\n",n);continue;} int len=n-f[n]; if(n%len==0) printf("0\n"); else printf("%d\n",len-(n%len)); } return 0;}
0 0
- 【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
- 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,最小循环节)
- hdu3746 Cyclic Nacklace
- HDU3746:Cyclic Nacklace
- Codeforces Round #377 (Div. 2) C Sanatorium
- JMeter+Badboy组合测试
- 简单工厂设计模式-模拟磁盘打开文件
- ORACLE中的SQL操作符
- Glide加载圆形图片
- HDU3746 Cyclic Nacklace(KMP)
- Android官方提供的支持不同屏幕大小的全部方法
- 数据流图技术相关基础知识
- 4513: [Sdoi2016]储能表
- 卷积神经网络与caffe Convolution层及参数设置
- iOS开发常用宏
- 用shell脚本合并多个文件内容
- 代理的使用步骤
- 树状列表组件JSTree的使用