Manacher 模板 最长回文串

note:
1. 通过添加特殊字符同时解决奇数偶数问题。
2. 通过已知结果进行优化。

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;
        }
    }
}