zoukankan      html  css  js  c++  java
  • 【HDU 3746 Cyclic Nacklace】

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 10685    Accepted Submission(s): 4583

    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.

    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 ).

    Output

    For 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

    Author

    possessor WC

    Source

    HDU 3rd “Vegetable-Birds Cup” Programming Open Contest

    Recommend

    lcy

    题解:
         ①找字符串最小循环节可以考虑利用KMP中的next数组匹配思想

         ②上述内容的结论:最小循环节=n-next[n]

         ③证明:画一个图,然后根据子串的相等关系可以得出。

    #include<stdio.h>
    #include<cstring>
    #define go(i,a,b) for(int i=a;i<=b;i++)
    const int N=100003;int T,m,j,f[N],n;char P[N];
    int main()
    {
    	scanf("%d",&T);
    	while(T--&&scanf("%s",P))
    	{
    		m=strlen(P);f[0]=f[1]=0;
    		go(i,1,m-1){j=f[i];while(j&&P[i]!=P[j])j=f[j];f[i+1]=P[i]==P[j]?j+1:0;}
    		(n=m-f[m])==m?printf("%d
    ",m):printf("%d
    ",m%n?n-m%n:0);
    	}
    	return 0;
    }//Paul_Guderian

    现在发生的一切永远将成为过去,

    璀璨的明天也只是印记。——————汪峰《上千个黎明》

  • 相关阅读:
    android monkey测试学习
    学习python的*args和 **kwargs
    TotoiseSVN 使用参考文章
    脚本判断访问终端是什么内核的浏览器
    Git两分钟指南-学习入门参考
    访问WebServcie遇到配额不足的时候,请增加配额
    错误1083:配置成在该可执行程序中运行的这个服务不能执行该服务 【解决】
    C# 如何获取错误所在行数
    mysql中如何使用一句话将一个表的数据导入到另一个表中:insert into ...select
    Windows Server 2008 MetaFile设置占用内存限制
  • 原文地址:https://www.cnblogs.com/Damitu/p/7648882.html
Copyright © 2011-2022 走看看