zoukankan      html  css  js  c++  java
  • HDU——T 3746 Cyclic Nacklace

    http://acm.hdu.edu.cn/showproblem.php?pid=3746

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

    Total Submission(s): 9975    Accepted Submission(s): 4267


    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
     
    Recommend
    lcy   |   We have carefully selected several similar problems for you:  1358 1686 2222 3068 2087 
     
     
     1 #include <algorithm>
     2 #include <cstring>
     3 #include <cstdio>
     4 
     5 using namespace std;
     6 
     7 const int N(100000+5);
     8 int len,p[N],ans;
     9 char s[N];
    10 
    11 inline void Get_next()
    12 {
    13     for(int j=0,i=2;i<=len;i++)
    14     {
    15         for(;j>0&&s[i]!=s[j+1];) j=p[j];
    16         if(s[i]==s[j+1]) j++;
    17         p[i]=j;
    18     }
    19 }
    20 
    21 int main()
    22 {
    23     int t;scanf("%d",&t);
    24     for(;t--;)
    25     {
    26         scanf("%s",s+1);
    27         len=strlen(s+1);
    28         memset(p,0,sizeof(p));
    29         Get_next();
    30         ans=len-p[len];
    31         for(int tmp=ans;ans<len;) ans+=tmp;
    32         if(!p[len]) printf("%d
    ",ans);
    33         else printf("%d
    ",ans-len);
    34     }
    35     return 0;
    36 }
    ——每当你想要放弃的时候,就想想是为了什么才一路坚持到现在。
  • 相关阅读:
    openfiler的介绍与使用
    linux磁盘修复(home或者其他目录无法进入,系统进入emergency mode)
    安装centos系统时出现dracut-initqueue time out 报错
    Linux中sz与rz命令
    /etc/passwd与/etc/shadow
    两台设备做DNS主从同步部署(含正向解析与方向解析)
    通过xftp传输文件失败的解决方法
    /etc/hosts与/etc/resolv.conf区别
    /etc/nsswitch.conf配置文件--服务搜索顺序
    docker学习笔记
  • 原文地址:https://www.cnblogs.com/Shy-key/p/7384125.html
Copyright © 2011-2022 走看看