HDU 2746 Cyclic Nacklace
2015-09-03 15:02
363 查看
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4420 Accepted Submission(s): 2011
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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 ).
[align=left]Output[/align]
For each case, you are required to output the minimum count of pearls added to make a CharmBracelet.
[align=left]Sample Input[/align]
3
aaa
abca
abcde
[align=left]Sample Output[/align]
0
2
5
[align=left]Author[/align]
possessor WC
KMP循环节题目:先求出这段序列的循环节大小,然后判断就可以了。
/* *********************************************** Author :pk28 Created Time :2015/9/3 10:37:18 File Name :4.cpp ************************************************ */ #include <iostream> #include <cstring> #include <cstdlib> #include <stdio.h> #include <algorithm> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <math.h> #include <stdlib.h> #include <iomanip> #include <list> #include <deque> #include <stack> #define ull unsigned long long #define ll long long #define mod 90001 #define INF 0x3f3f3f3f #define maxn 100000+10 #define cle(a) memset(a,0,sizeof(a)) const ull inf = 1LL << 61; const double eps=1e-5; using namespace std; bool cmp(int a,int b){ return a>b; } char s[maxn]; int f[maxn],m; void getFail(char *p,int *f){ m=strlen(p); f[0]=0;f[1]=0; for(int i=1;i<m;i++){ int j=f[i]; while(j&&p[i]!=p[j])j=f[j]; f[i+1]=p[i]==p[j]?j+1:0; } } int main() { #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif //freopen("out.txt","w",stdout); int t; scanf("%d",&t); while(t--){ scanf("%s",s); getFail(s,f); int x=m-f[m];//循环节 的长度 if(f[m]!=0&&m%x==0){ printf("%d\n",0); } else{ printf("%d\n",x-m%x); } } return 0; }
[align=left] [/align]
相关文章推荐
- twoSum(C++)
- 一个自动备份软件的实现
- 深入理解Git (五) - commit链的形成
- hdu4389 Xmod f(x) 数位DP
- html 文本标签
- 1058. A+B in Hogwarts (20) -- 数据范围问题
- 一道关于笔试的多线程题目
- 后台开发面试准备2:linux共享内存
- python2.7学习笔记(8) ——模块
- 绘图与动画之使用自定义属性与颜色渐变实现色带加载动画
- TCP/IP、Http等各层协议汇总表
- ios开发 UI阶段第八周
- android性能优化之SparseArray
- LTE学习:LTE系统中RB、RBG、CCE、REG分别是如何定义的
- NOIP2014联合权值
- 一名程序员的自我修养
- JavaScript-概述
- scanf和gets的几个区别
- Android drawable中xml标签属性
- 小议:SharePoint 2013如何创建与Web Application不同的Host Header Site Collection?