weixin_45113721的博客

讲解：https://blog.youkuaiyun.com/chenzhenyu123456/article/details/49403031 #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int MAXN=1100100; int Ma[MAXN*2]; int Mp[MAXN*2]; void Manacher(

#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int MAXN=1100100; int Ma[MAXN*2]; int Mp[MAXN*2]; void Manacher(char s[],int len) { int l=0; Ma[l++]='$'; Ma[l++]='#'; fo

比普通的manacher多添加条件 可以用-1 -2 -3去填充数组 这样可以只比较原数组的大小（当数小于0时不用比较） #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int MAXN=1100100; int Ma[MAXN*2]; int Mp[MAXN*2]; void Manacher(int s[

mancher 模板 #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int MAXN=110010; char Ma[MAXN*2]; int Mp[MAXN*2]; void Manacher(char s[],int len) { int l=0; Ma[l++]='$'; Ma[l++

#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<queue> using namespace std; const int N=1e6+100; char ss[N]; char s[N*2]; char str[N]; ...