题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3068
题意:求最长回文子串
解题方案:Manacher算法 (好博客 https://www.felix021.com/blog/read.php?entryid=2040&page=1&part=1)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define FORR(i,k,n) for(int i=k;i<=n;i++)
#define scan(a) scanf("%d",&a)
#define scann(a,b) scanf("%d%d",&a,&b)
#define scannn(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define mst(a,n) memset(a,n,sizeof(a))
#define ll long long
#define N 1000000
#define mod 1000000007
#define INF 0x3f3f3f3f
const double eps=1e-8;
const double pi=acos(-1.0);
char s[N],s1[N];
int p[N];//p[i]为以位置i为对称轴的回文串的半径
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(~scanf("%s",s))
{
int ans=0;
int id=0;//对称轴
int mx=0;//当前已经处理到的回文串中最右界的最远位置
int idx=0;
mst(p,0);
for(int i=0;s[i];i++) s1[idx++]='#',s1[idx++]=s[i];
s1[idx]='#';
for(int i=0;s1[i];i++)
{
if(i<mx) p[i]=min(p[2*id-i],mx-i);
else p[i]=1;
while(i+p[i]<=idx&&i-p[i]>=0&&s1[i+p[i]]==s1[i-p[i]]) p[i]++;
if(i+p[i]>mx)
{
mx=i+p[i];
id=i;
}
ans=max(ans,p[i]);
}
printf("%d\n",ans-1);
}
return 0;
}