manacher 模板

$O(n)$处理出字符串中每个点作为中间点的回文串长度。在每个字符前后插入’#’，串首串尾再分别插入没有出现过的不同字符。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

char a[11000005], s[11000005<<2];
int tot, p[11000005<<2];

void get ( ) {
    int len = strlen ( a );
    s[0] = '$';
    for ( int i = 0; i < len; i ++ ) {
        s[2 * (i+1) - 1] = '#';
        s[2 * (i+1)] = a[i];
    }
    s[2 * (len+1) - 1] = '#';
    s[tot = 2 * len + 2] = '%';
}

int main ( ) {
    scanf ( "%s", a );
    get ( );
    int mx = 0, id = 0, max_l = 0;
    for ( int i = 1; i <= tot; i ++ ) {
        if ( i < mx ) p[i] = min ( mx - i, p[2 * id - i] );
        else p[i] = 1;
        while ( s[i+p[i]] == s[i-p[i]] ) p[i] ++;
        if ( mx < i + p[i] ) {
            mx = i + p[i];
            id = i;
        }
        max_l = max ( max_l, p[i] - 1 );
    }
    printf ( "%d", max_l );
}