Hdu 3068 最长回文

Problem:
给定一个字符串，求这个字符串中最长的回文字符串。
Solution:
利用manacher算法。

#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<vector>
#include<fstream>
#include<list>
using namespace std;

#define ms(s) memset(s,0,sizeof(s))
typedef unsigned long long ULL;
typedef long long LL;

const double PI = 3.141592653589;
const int INF = 0x3fffffff;

const int maxn = 110005;
char str[maxn<<1];  int pa[maxn<<1];  int Slen;
void manacher(char s[]){
    int i = 0, j = 0, maxs = 0, pos = 0;

    str[j++] = '$';  str[j++] = '#';
    while(s[i] != '\0'){
        str[j++] = s[i++];
        str[j++] = '#';
    }
    str[j] = '\0';

    Slen = j;
    for(i = 1; i < Slen; ++i){
        if(i < maxs)
            pa[i] = min(pa[2*pos-i], maxs-i);
        else
            pa[i] = 1;
        while(str[i+pa[i]] == str[i-pa[i]])
            ++pa[i];
        if(pa[i]+i > maxs){
            maxs = pa[i]+i;  pos = i;
        }
    }
}
char s[maxn];

int main(){
//    freopen("D:\\input.txt","r",stdin);
//    freopen("D:\\output.txt","w",stdout);
//    ios::sync_with_stdio(false);

    while(~scanf("%s",s)){
        manacher(s);
        int mx = 0;
        for(int i = 0; i < Slen; ++i)
            mx = max(mx,pa[i]);
        printf("%d\n",mx-1);
    }

    return 0;
}