洛谷P3805 【模板】manacher算法

P3805 【模板】manacher算法
原题地址
板子题

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define For(i,x,y) for(ll i = (x);(i) <= (y);++(i))
#define FOr(i,x,y) for(ll i = (x);(i) < (y);++(i))
inline ll read(){
	ll x = 0,f = 1;char ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-')f = -1;ch = getchar();}
	while(ch >= '0' && ch <= '9'){x = x*10+ch-'0';ch = getchar();}
	return x*f;
}

const int N = 3e7;
char s[N],s1[N];
ll p[N],mx,Ans = -1;
signed main(){
	ll n,m = 0;
	scanf("%s",s+1);
	n = strlen(s+1);
	s1[m] = '#';
	For(i,1,n){
		s1[++m] = s[i];
		s1[++m] = '#';
	}
	s1[m] = '#';
	s1[m+1] = '\0';
	mx = 0;
	ll id = 0;
	For(i,1,m){
		if(i < mx) p[i] = min(p[2*id-i],mx-i);
		else p[i] = 1;
		while(i-p[i] >= 0 && i+p[i] <= m && s1[i-p[i]] == s1[i+p[i]]) ++p[i];
		if(mx < i+p[i]){
			id = i; mx = i+p[i];
		}
		Ans = max(Ans,p[i]-1);
	}
	printf("%lld\n",Ans);
}