hdu 3746 Cyclic Nacklace ( kmp )
来源:互联网 发布:搜狗输入法怎么卸载mac 编辑:程序博客网 时间:2024/05/08 18:55
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3284 Accepted Submission(s): 1500
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
题目大意:求当前串补充为一个循环次数不小于2的循环串需要最少添几个字母
题目分析:我们可以通过len-Next[len]得到循环节的长度,然后判断当前按原串是否是符合题目要求,如果符合就不永添,如果用添,那么添加的就是
len-Next[len]-Next[len]%(len-Next[len])个字母,因为循环节减去后缀中已经和前缀匹配上的串,就是需要补充的串
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#define MAX 100007using namespace std;int Next[MAX],t;char s[MAX];void get_Next ( ){ int i = 0 , k = -1 , len = strlen(s); Next[0] = -1; while ( i < len ) if ( k == -1 || s[i] == s[k] ) i++,k++,Next[i] = k; else k = Next[k]; }void solve ( ){ get_Next ( ); int len = strlen ( s ); int ans = len; int length = len - Next[len]; if ( len != length && len%length == 0 ) ans = 0; else { ans = length - Next[len]%length; } printf ( "%d\n" , ans );}int main ( ){ scanf ( "%d" , &t ); while ( t-- ) { scanf ( "%s" , s ); solve ( ); }}
0 0
- KMP hdu-3746-Cyclic Nacklace
- HDU 3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace KMP
- HDU 3746 Cyclic Nacklace KMP
- HDU 3746 Cyclic Nacklace KMP
- hdu 3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace KMP
- hdu 3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace / KMP
- HDU--3746--Cyclic Nacklace【KMP】
- hdu-3746 Cyclic Nacklace 【kmp】
- hdu 3746 Cyclic Nacklace ( kmp )
- HDU-3746 Cyclic Nacklace (kmp)
- [hdu 3746] Cyclic Nacklace [kmp]
- hdu 3746 Cyclic Nacklace kmp
- hdu 3746 Cyclic Nacklace (KMP)
- |Hdu 3746|KMP|Cyclic Nacklace
- Hdu-3746-Cyclic Nacklace-【KMP】
- 关于vim的胡扯
- 指针的大小到底是由谁决定?是多少?
- 算法导论学习之快排+各种排序算法时间复杂度总结
- 黑马程序员--Java基础--IO流
- fseek、ftell、fread、fwrite
- hdu 3746 Cyclic Nacklace ( kmp )
- 正则表达式验证邮箱格式
- secureCRT密钥登陆
- 适配器 Adapter
- 我的新博客开通啦
- Android中的弹出提示框
- POJ 1113 Wall (凸包模版题)
- 可变参数列表的实现
- content = "IE=edge,chrome=1" 详解,若不支持,在Apache/IIS设置支持