manacher算法求一个串中的最长回文子串; 时间复杂度基本为O(n)。
模板:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 2*1e5 + 100;
char s[maxn], a[maxn];
int p[maxn<<1];
int manacher()
{
int n = strlen(s+1);
for(int i = 1; i <= n; i++)
{
a[i<<1] = s[i];
a[i<<1|1] = '#';
}
a[0] = '?', a[1] = '#';
n = (n+1)*2;
a[n] = 0;
int id, MaxId = 0, MaxL = 0;
for(int i = 1; i < n; i++)
{
if(MaxId > i)
{
p[i] = min(p[2*id-i], MaxId-i);
}
else
{
p[i] = 1;
}
while(a[i+p[i]] == a[i-p[i]])
{
p[i]++;
}
if(p[i]+i > MaxId)
{
MaxId = p[i] + i;
id = i;
}
if(p[i] > MaxL)
{
MaxL = p[i];
}
}
return MaxL - 1;
}
int main()
{
while(~scanf("%s", s+1))
{
int ans = manacher();
printf("%d\n", ans);
}
return 0;
}