manacher回文串算法

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;

char c[310010],s[310010];
int p[310010];
int main()
{
	freopen("manacher.in","r",stdin);
	freopen("manacher.out","w",stdout);
	scanf("%s",c);
	int n=strlen(c);
  	s[0]='$';s[1]='#';s[(n+1)<<1]='%';
  	for (int i=1; i<=n; i++) s[i<<1]=c[i-1],s[i<<1|1]='#';
  	n=n<<1|1;
    int mx=0,id=0;
    for (int i=1; i<=n; i++)
    {
   		if (mx>i)	p[i]=min(p[id*2-i],mx-i+1);
   			else p[i]=0;
    	while (s[i+p[i]+1]==s[i-p[i]-1])	p[i]++;
   		if (i+p[i]>mx) mx=i+p[i],id=i;
    }
	for (int i=0; i<=n; i++)	printf("%3c",s[i]);printf("\n");
	for (int i=0; i<=n; i++)	printf("%3d",p[i]);printf("\n");
	return 0;
}