HDU 3294 Girls' research Manacher 求最长回文串起始位置及长度

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 
#include 
#include 
#include 
#include 
#define MAXN 200100
using namespace std;
char ss[MAXN];//原串
int str[MAXN*2];//新串 注意数组大小
int p[MAXN*2];
int pos;//记录回文字符串的中心位置
int Manacher(char *T)
{
    int len = strlen(T);
    int l = 0;
    str[l++] = '@';//防止越界
    str[l++] = '#';
    for(int i = 0; i < len; i++)
    {
        str[l++] = T[i];
        str[l++] = '#';
    }
    str[l] = 0;
    int mx = 0, id = 0;
    int ans = 0;
    for(int i = 0; i < l; i++)
    {
        if(mx > i)//2*id-i 为 i关于id的对称点
            p[i] = min(p[2*id - i], mx-i);
        else
            p[i] = 1;
        //左右延伸
        while(str[i+p[i]] == str[i-p[i]]) p[i]++;
        if(i + p[i] > mx)//找计算p[i+1]用到的id
        {
            mx = i + p[i];
            id = i;
        }
        if(p[i]> ans)
        {
            ans = p[i];
            pos = i;//记录最长的p值
        }
    }
    return ans-1;
}
int main()
{
    char op; char a[2];
    while(scanf("%s%s", a, ss) != EOF)
    {
        op = a[0];
        int len = Manacher(ss);//求字符串s的 最长回文子串长度
        if(len < 2)
            printf("No solution!\n");
        else
        {
            cout<= t)
                    printf("%c", ss[i] - t);
                else
                    printf("%c", ss[i] + 26 - t);
            }
            printf("\n");
        }
    }
    return 0;
}