HDU 3746 Cyclic Nacklace(Next 数组性质)
来源:互联网 发布:java excel导入导出 编辑:程序博客网 时间:2024/05/28 11:50
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
题目大意:给一个字符串,问最少增加多少个字符可以让它变成循环的,循环节循环次数两次以上。
考察 Next 数组性质。
代码:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 1e5 + 5;int n[maxn];char m[maxn];void getnext(){ int i = 0,j = -1; n[0] = -1; while(m[i] != '\0') { while(j != -1 && m[i] != m[j]) j = n[j]; n[++i] = ++j; }}int main(){ int t; scanf("%d",&t); while(t--) { scanf(" %s",m); getnext(); int l = strlen(m); int k = l - n[l]; if(l % k) printf("%d\n",k - l % k); else printf("%d\n", l / k > 1 ? 0 : k); } return 0;}
阅读全文
0 0
- HDU 3746 Cyclic Nacklace(Next 数组性质)
- HDU 3746 Cyclic Nacklace (next数组)
- HDU-3746 Cyclic Nacklace (活用KMP中next数组)
- HDU 3746 Cyclic Nacklace //深刻理解next数组
- HDU 3746 Cyclic Nacklace (next数组的应用)
- HDU Cyclic Nacklace (KMP-next数组的利用)
- HDU 3476 Cyclic Nacklace(next数组应用)
- hdu 3746 Cyclic Nacklace(KMP中next数组的运用)
- HDU-3746 Cyclic Nacklace (对next的深入思考)
- Cyclic Nacklace next数组应用
- Cyclic Nacklace(HDU 3746)
- HDU 3746 Cyclic Nacklace KMP的性质应用
- HDU 3746 Cyclic Nacklace 利用 KMP的next数组求循环节
- hdu 3749 Cyclic Nacklace(kmp next数组获取循环节)
- HDU-3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- 上了两个月的班,感觉大学一年白读。
- 1030 Dijkstra+DFS
- loadrunner测试springboot的api接口
- POJ 1035 Spell checker 串
- 内网容器化实践
- HDU 3746 Cyclic Nacklace(Next 数组性质)
- Codeforces Round #412 D. Dynamic Problem Scoring (枚举 + 贪心)
- 【08】Bootstrap — 按钮
- Python 学习6
- bzoj 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐(暴力DFS)
- [ZJOI2016]线段树
- CodeForces
- 编写现代 CSS 代码的 20 个建议
- JavaScript模板引擎