Manacher
求最长回文子串
ACM模板
C++
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 100000 + 10;
char Ma[MAXN << 1];
int Mp[MAXN << 1];
void Manacher(char s[], int len)
{
int l = 0;
Ma[l ++] = '$';
Ma[l ++] = '#';
for(int i = 0; i < len; i ++)
{
Ma[l ++] = s[i];
Ma[l ++] = '#';
}
Ma[l] = 0;
int mx = 0, id = 0;
for(int i = 1; i <