hdu3746 kmp求循环节
Posted walfy
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了hdu3746 kmp求循环节相关的知识,希望对你有一定的参考价值。
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.
InputThe 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 ).OutputFor 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
题意:给一个字符串你,求需要在末尾加几个字符使它变成最少两个循环的
题解:利用Next数组的性质,循环节就是slen-Next【slen-1】-1,刚开始自己推出来了,结果细节没考虑到):
#include<map> #include<set> #include<cmath> #include<queue> #include<stack> #include<vector> #include<cstdio> #include<iomanip> #include<cstdlib> #include<cstring> #include<iostream> #include<algorithm> #define pi acos(-1) #define ll long long #define mod 1000000007 #define ls l,m,rt<<1 #define rs m+1,r,rt<<1|1 using namespace std; const double g=10.0,eps=1e-9; const int N=100000+5,maxn=1000000+5,inf=0x3f3f3f3f; int Next[N],slen,plen; string str,ptr; void getnext() { int k=-1; Next[0]=-1; for(int i=1;i<slen;i++) { while(k>-1&&str[k+1]!=str[i])k=Next[k]; if(str[k+1]==str[i])k++; Next[i]=k; } } int main() { ios::sync_with_stdio(false); cin.tie(0); // cout<<setiosflags(ios::fixed)<<setprecision(2); int t; cin>>t; while(t--){ cin>>str; slen=str.size(); getnext(); if(Next[slen-1]==-1) { cout<<slen<<endl; continue; } int ans=slen-Next[slen-1]-1; if(slen%ans==0)cout<<0<<endl; else cout<<ans-slen%ans<<endl; } return 0; }
以上是关于hdu3746 kmp求循环节的主要内容,如果未能解决你的问题,请参考以下文章
HDU 3746 - Cyclic Nacklace - [KMP求最小循环节]
hdu 3746 Cyclic Nacklace (KMP求最小循环节)
HDU3746 Cyclic Nacklace KMP求循环节