Cyclic Nacklace
来源:互联网 发布:发票软件哪里下载 编辑:程序博客网 时间:2024/06/07 03:24
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
Hint
题意
要得到一个左右对称的串 即让原串满足它是得到的串的循环节 问最短满足条件的串
题解:
AC代码
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int MAXN = 1e5+10;char st[MAXN];int nxt[MAXN];int a[MAXN];void getnext(int l){ int i = 0,j = 0; nxt[0] = -1; j = nxt[0]; while (i < l){ if (j == -1 || st[i] == st[j]){ nxt[++i] = ++j; }else j = nxt[j]; }}int main(){ int t; scanf("%d",&t); while (t--){ memset(nxt,0,sizeof(nxt)); memset(a,0,sizeof(a)); scanf("%s",st); int len = strlen(st); getnext(len); int d = len - nxt[len]; //计算单位循环长度 if (len!=d&&len%d==0) printf("0\n"); //满足由单位串拼接而成 else printf("%d\n",d-len%d); //否则输出没有计入循环的串的个数 } return 0;}
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- hdu3746 Cyclic Nacklace
- HDU-3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdoj 3746 Cyclic Nacklace
- 【KMP】 hdu3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU3746:Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdu3476-Cyclic Nacklace
- 投影坐标,平面以及坐标转换
- 在 Laravel 5 中使用 Laravel Excel 实现 Excel/CSV 文件导入导出功能
- 自定义struts2拦截器
- 图像处理总结
- hdu 1173
- Cyclic Nacklace
- iOS FM源码、OFO共享单车源码、股票K线分时线源码等
- css-3.尺寸和颜色
- 设置meta标签 清除页面缓存,如:<meta http-equiv="Cache-Control" content="no-cache"/>
- centOS中mysql/mariaDB一些常用操作命令
- Unity鼠标点击手势识别(上、下、左、右滑动)
- springboot【20】日志管理之log4j实现http请求日志入mongodb
- 简单有趣的 NLP 教程:手把手教你用 PyTorch 辨别自然语言(附代码)
- 住建部BIM标准成功获批联袂国建融科合创打造BIM数据库