hdu——3746Cyclic Nacklace(kmp专练)
来源:互联网 发布:如何设置hp网络打印机 编辑:程序博客网 时间:2024/05/22 15:03
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5727 Accepted Submission(s): 2587
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
kmp算法的简单应用
#include<iostream>#include<string>#include<cstring>using namespace std;int nexta[400010];void getnext(string n){int i=0,j=-1;nexta[0]=-1;while(i<n.size()){if(j==-1||n[i]==n[j]){++i;++j;nexta[i]=j;}else j=nexta[j];}}int main(){string n;long long m,k,i;ios::sync_with_stdio(false);cin>>k;while(k--){cin>>n;getnext(n);m=n.length();i=m-nexta[m];//除去最大前缀的剩余部分if(i==m)cout<<m<<endl;//每个元素各不相同就输出元素的个数else {if(m%i==0){cout<<"0"<<endl;}else cout<<i-m%i<<endl;//输出缺的个数}}return 0;}
0 0
- hdu——3746Cyclic 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)Cyclic Nacklace ---KMP(串)
- hdu 3746 Cyclic Nacklace (kmp扩展—最小循环节)
- KMP hdu-3746-Cyclic Nacklace
- 《java入门第一季》之面向对象(一个易错面试题)
- KVC中setValuesForKeysWithDictionary
- 半正定矩阵理解
- ubuntu下的文件夹结构,以及作用
- 【HUSTOJ】1063: 对角线II
- hdu——3746Cyclic Nacklace(kmp专练)
- 2.数理统计与参数估计
- xargs命令
- HTTP返回状态码总结
- 数据结构_线性表_链式存储_单链表 的基本操作
- 【GOF23设计模式】_建造者模式详解_类图关系JAVA232
- 1011. World Cup Betting (20)
- 同步/异步、阻塞/非阻塞
- java使用FileReader读取一个.java文件,并打印在控制台上。