在求一个字符串的最长回文子串时,当数据较大的时候,需要用到Manacher算法:
#include <bits/stdc++.h>
using namespace std;
const int N = 220005;
char s[N];
int p[N],n,id,mx;
void Manacher(){
id = mx = 0;
int ans = 0;
n = strlen(s);
for(int i = n;i >= 0;i--){
s[2*i+2] = s[i];
s[2*i+1] = '#';
}
s[0] = '@';
p[0] = 1;
for(int i = 1;i < 2*n+2;i++){
if(mx > i) p[i] = min(p[2*id-i],mx-i);
else p[i] = 1;
while(s[i+p[i]] == s[i-p[i]]) p[i] += 1;
if(mx < p[i]+i){
id = i;
mx = p[i]+i;
}
ans = max(ans,p[i]-1);
}
printf("%d\n",ans);
}
int main(){
while(~scanf("%s",s)) Manacher();
return 0;
}