HDU
来源:互联网 发布:lol西西软件下载 编辑:程序博客网 时间:2024/05/18 00:52
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<cstring>#include<algorithm>using namespace std;char b[100005];int nex[100005];int ans;void get_next(){int j=-1,i=0;nex[0]=-1;int m=strlen(b);while(i<m){if(j==-1 || b[i]==b[j])nex[++i]=++j;else j=nex[j];}//nex[m]=0代表之前没有循环出现 //if(nex[m]==0)printf("%d\n",m);//else{//int num=m-nex[m];//循环节长度 //int k=(nex[m])%num;//取余即abcab除去abc ////if(k==0)printf("0\n");//正好完全循环完成 //else printf("%d\n",num-k);//}}int main(){int t;scanf("%d",&t);while(t--){ans=0;scanf("%s",b);get_next();int n=strlen(b);int len= n - nex[n];//循环节长度 int num=n/len;//循环节个数 int k =len -(n - num*len); if(k == len && num > 1) k = 0;printf("%d\n",k);}return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- Oracle安装、卸载
- POJ 1469 COURSES(二分图最大匹配) (矩阵和邻接表的模板题)
- 输出数组的所有元素的排列组合(递归)
- 基于python+requests+unittest框架接口自动化测试设计开发(简易型)
- HDU6143-Killer Names
- HDU
- java设计模式
- Java——集合框架之ArrayList,LinkedList,迭代器Iterator
- 主成分分析(PCA)原理详解
- POJ.2378 Tree Cutting (树形DP 树的重心)
- Ubuntu16.04安装pcl出现cannot find -lvtkproj4解决办法
- python的scikit-learn的主要模块和基本使用
- JS DOM节点
- HDU1226:超级密码(BFS)