马拉车算法

详细讲解：

https://www.cnblogs.com/grandyang/p/4475985.html

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!

#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int mx=0,id=0,maxcenter=0,maxlen=0;

void Manacher(string s){

    string t="$#";
    mx=0,id=0,maxcenter=0,maxlen=0;
    for(int i=0;i<s.size();i++){
        t+=s[i];
        t+='#';
    }//加上字符
    vector<int>p(t.size(),0);//创建一个有t.size（）个元素 ，均值为0的整型数组
    for(int i=1;i<t.size();i++){
        p[i]=mx>i?min(p[2*id-i],mx-i):1;
        while(t[i-p[i]]==t[i+p[i]]) ++p[i];//半径长度进行扩展
        if(mx<i+p[i]){
            mx=i+p[i];
            id=i;
        }
        if(maxlen<p[i]){
            maxcenter=i;
            maxlen=p[i];
        }
    }
    //return s.substr((maxcenter-maxlen)/2,maxlen-1); //开始位置 字符串长度
}
int main(){
    char ch;
    string s;
    int len;
    while(scanf("%c",&ch)!=EOF){

        cin>>s;

        Manacher(s);

        if(maxlen<=2) printf("No solution!\n");
        else{
            len=ch-'a';

            printf("%d %d\n",(maxcenter-maxlen)/2,(maxcenter-maxlen)/2+maxlen-2);
            for(int i=(maxcenter-maxlen)/2;i<maxlen-1+(maxcenter-maxlen)/2;i++){
                if(s[i]>=ch) {
                    cout<<(char)(s[i]-len);
                }
                else{
                    cout<<(char)('z'+(s[i]-'a'-len)+1);
                }
            }
            printf("\n");
        }
        getchar();
    }
    return 0;
}