HDU 3294 Girls' research （马拉车）

Girls' research

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 4862    Accepted Submission(s): 1821

 

Problem 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!

题意：给你一个字符和一个字符串（长度不超过2e5），求最长回文子串，然后每个字母左移第一个字符-‘a’位。（比如样例给了b，那串中a变成z,b变成a，c变成b这样子。）

思路：

马拉车算法模板。

代码：

#include<iostream>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<string>
#include<queue>
#include<vector>
#include<map>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn=1000010;
char str[maxn],ss[2];//原字符串
char tmp[maxn<<1];//转换后的字符串
int Len[maxn<<1],pos;
//转换原始串
int INIT(char *st)
{
    int i,len=strlen(st);
    tmp[0]='@';//字符串开头增加一个特殊字符，防止越界
    for(i=1;i<=2*len;i+=2)
    {
        tmp[i]='#';
        tmp[i+1]=st[i/2];
    }
    tmp[2*len+1]='#';
    tmp[2*len+2]='$';//字符串结尾加一个字符，防止越界
    tmp[2*len+3]=0;
    return 2*len+1;//返回转换字符串的长度
}
//Manacher算法计算过程
int MANACHER(char *st,int len)
{
     int mx=0,ans=0,po=0;//mx即为当前计算回文串最右边字符的最大值
     for(int i=1;i<=len;i++)
     {
         if(mx>i)
         Len[i]=min(mx-i,Len[2*po-i]);//在Len[j]和mx-i中取个小
         else
         Len[i]=1;//如果i>=mx，要从头开始匹配
         while(st[i-Len[i]]==st[i+Len[i]])
         Len[i]++;
         if(Len[i]+i>mx)//若新计算的回文串右端点位置大于mx，要更新po和mx的值
         {
             mx=Len[i]+i;
             po=i;
         }
         if(Len[i]>ans){
           ans=Len[i];
           pos=i;
         }
     }
     return ans-1;//返回Len[i]中的最大值-1即为原串的最长回文子串额长度
}
int main()
{
    int T,cas=1;
    while(scanf("%s%s",ss,str)!=EOF)
    {
        int len=INIT(str);
        int as=MANACHER(tmp,len);
        if(as==1) puts("No solution!");
        else
        {
            int l,r;
            l=(pos-1)/2-as/2;
            r=(pos-1)/2+as/2;
            if((as&1)==0) r--;
            printf("%d %d\n",l,r);
            int dt=ss[0]-'a';
            for(int i=l;i<=r;i++)
            {
                str[i]-=dt;
                if(str[i]<'a') str[i]+=26;
                str[i-l]=str[i];
            }
            str[r-l+1]='\0';
            printf("%s\n",str);
        }

    }
    return 0;
}