zoukankan      html  css  js  c++  java
  • (回文串 Manacher )Girls' research -- hdu -- 3294

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

    Girls' research
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

    Description

    One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps: 
    First step: girls will write a long string (only contains lower case) on the paper. For example, "abcde", but 'a' inside is not the real 'a', that means if we define the 'b' is the real 'a', then we can infer that 'c' is the real 'b', 'd' is the real 'c' ……, 'a' is the real 'z'. According to this, string "abcde" changes to "bcdef". 
    Second step: girls will find out the longest palindromic string in the given string, the length of palindromic string must be equal or more than 2.
     

    Input

    Input contains multiple cases. 
    Each case contains two parts, a character and a string, they are separated by one space, the character representing the real 'a' is and the length of the string will not exceed 200000.All input must be lowercase. 
    If the length of string is len, it is marked from 0 to len-1.
     

    Output

    Please execute the operation following the two steps. 
    If you find one, output the start position and end position of palindromic string in a line, next line output the real palindromic string, or output "No solution!". 
    If there are several answers available, please choose the string which first appears.
     

    Sample Input

    b babd
    a abcd
     

    Sample Output

    0 2
    aza
    No solution!
     
    只要找到起始点,一切就OK了!!!
    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    
    using namespace std;
    #define INF 0x3f3f3f3f
    #define N 1000007
    
    char s[N], S[N], str[N];
    int  p[N], Mid;
    
    int Manacher()
    {
        int MaxLen = 0, index = 0, ans = 1;
        int len = strlen(s);
        Mid = 0;
    
        for(int i=2; i<len; i++)
        {
            if(MaxLen>i) p[i] = min(p[index*2-i], MaxLen-i);
            else p[i] = 1;
    
            while(s[i-p[i]]==s[i+p[i]] )
                p[i]++;
    
            if(p[i]+i>MaxLen)
            {
                MaxLen = p[i] + i;
                index = i;
            }
    
            if(p[i]>ans)
            {
                ans = p[i];
                Mid = i;
            }
        }
        return ans-1;
    }
    
    int main()
    {
        char ch[10];
    
        while(scanf("%s%s", ch, S)!=EOF)
        {
            int i, len = strlen(S), number;
            char c;
    
            number = ch[0]-'a';
    
            s[0] = '$';
            for(i=0; i<len; i++)
            {
                c = S[i] - number;
                if(c<'a')
                    c += 26;
                S[i] = c;
    
                s[i*2+1] = '#';
                s[i*2+2] = S[i];
            }
            s[i*2+1] = '#';
            s[i*2+2] = 0;
    
            int ans = Manacher();
    
            if(ans<2)
               printf("No solution!
    ");
            else
            {
                int L = Mid/2-(ans+1)/2;
                printf("%d %d
    ", L, L+ans-1);
                memset(str, 0, sizeof(str));
                strncpy(str, S+L, ans);
                printf("%s
    ", str);
            }
        }
        return 0;
    }
    View Code
    勿忘初心
  • 相关阅读:
    功能:Java注解的介绍和反射使用
    功能:@Vaild注解使用及扩展
    转载:微信小程序view布局
    功能:Java8新特性steam流
    功能:Linux运行jar包Shell脚本
    转载:Windows使用tail -f 监控文件
    转载:java.math.BigDecimal 比较大小
    问题:跨域及解决方案
    基于 @SelectProvider 注解实现无侵入的通用Dao
    SpringBoot中的异步操作与线程池
  • 原文地址:https://www.cnblogs.com/YY56/p/4853644.html
Copyright © 2011-2022 走看看