HDU 3746 Cyclic Nacklace //深刻理解next数组
来源:互联网 发布:java并发编程的书籍 编辑:程序博客网 时间:2024/05/29 07:22
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2599 Accepted Submission(s): 1174
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
Recommend
lcy | We have carefully selected several similar problems for you: 3336 1358 2222 3068 2896
#include <stdio.h>#include <string.h>char ch[1000005];int next[1000005];void getnext(){int i, j;i=0; j=-1; next[0]=-1;while(ch[i]){if(j==-1 || ch[i]==ch[j]){i++;j++;next[i] = j;}elsej = next[j];}}int find(){int cir, len;int count;len = strlen(ch);cir = len - next[len];//循环节长度,必须深刻理解next[]数组含义!!!if(len%cir==0 && len!=cir) //当len%cir==0时 代表自身已是循环节,不需添加,注意当next[len]==0时的情况。count = 0;elsecount = cir - (len-(len/cir)*cir); // len/cir 表示有多少个循环节,(len/cir)*cir表示已经满足循环的个数。//len-(len/cir)*cir表示未满足循环条件的个数,cir-(len-(len/cir)*cir)表示需要添加的个数。return count;}int main(){int t;scanf("%d", &t);while(t--){scanf("%s", ch);getnext();printf("%d\n", find());}return 0;}
0 0
- HDU 3746 Cyclic Nacklace //深刻理解next数组
- HDU 3746 Cyclic Nacklace (next数组)
- HDU 3746 Cyclic Nacklace (next数组的应用)
- HDU 3746 Cyclic Nacklace(Next 数组性质)
- HDU-3746 Cyclic Nacklace (活用KMP中next数组)
- Cyclic Nacklace next数组应用
- HDU Cyclic Nacklace (KMP-next数组的利用)
- HDU 3476 Cyclic Nacklace(next数组应用)
- HDU 3746 Cyclic Nacklace 利用 KMP的next数组求循环节
- hdu 3746 Cyclic Nacklace(KMP中next数组的运用)
- HDU-3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU-Cyclic Nacklace-3746
- hdu 3746 Cyclic Nacklace
- 工作中的感悟 (三)三个月碎碎念篇
- 暑期个人赛--第一场--A -
- C++程序设计课程
- 有关条件编译、extern的问题
- mac eclipse 编码 GBK
- HDU 3746 Cyclic Nacklace //深刻理解next数组
- 内核模块学习
- 几款百度竞价点击软件测评来一发
- Firefox必备的24款web开发插件
- FreeBSD 平台 OpenVPN 的安装、配置客户端和服务端
- Unix/Linux环境C编程入门教程(35) 编程管理系统中的组
- 关于2011级报考高级中学教师资格证同学领取相关教材及培训的通知 笨木头-CSDN
- GCD 笔记
- 快速矩阵幂