hdu 3746 Cyclic Nacklace (kmp)
来源:互联网 发布:社交软件市场分析 编辑:程序博客网 时间:2024/05/20 18:42
http://acm.hdu.edu.cn/showproblem.php?pid=3746
Cyclic Nacklace
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
求在后面加几个字母可以使之成为重复串
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include <cmath>#include <cstdlib>#include <limits>#include <queue>#include <stack>#include <vector>#include <map>using namespace std;#define N 101000#define INF 0x3f3f3f3f#define PI acos (-1.0)#define EPS 1e-8#define met(a, b) memset (a, b, sizeof (a))char s[N];int Next[N];void get_next (char s[], int n, int Next[]);int main (){ int t; scanf ("%d", &t); while (t--) { scanf ("%s", s); int len = strlen (s); get_next (s, len, Next); int ans = len - Next[len]; if (ans != len && len % ans == 0) puts ("0"); else printf ("%d\n", ans-Next[len]%ans); } return 0;}void get_next (char s[], int n, int Next[]){ int i = 0, j = -1; Next[i] = -1; while (i < n) { if (j == -1 || s[i] == s[j]) Next[++i] = ++j; else j = Next[j]; } return;}
0 0
- 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
- HDU 3746 Cyclic Nacklace(KMP)
- HDU 3746 Cyclic Nacklace KMP
- HDU 3746 Cyclic Nacklace KMP
- spring mvc获取request HttpServletRequest
- Linux下检测FTP服务并开启FTP服务
- Linux 强大的nohup(进程后台执行)
- apache/mysql/php(wamp環境配置)
- SourceInsight 日文乱码 问题解决方案
- hdu 3746 Cyclic Nacklace (kmp)
- 【手势交互】12. MYO臂环
- c#中如何避免Button,CheckBox等的点击状态时的焦点矩形框问题:
- Kth Largest Element in an Array
- Java调用MATLAB程序
- C++ 01背包
- print_r($_POST); 查看POST数据。
- 开始安装centOS
- 2015 ACM/ICPC合肥网赛&HDU5491 The Next