Manacher（马拉车）算法-最长回文子串O(n)

存一个板子

最长回文子串的线性处理方法，注意是子串，和子序列不同

写一个板子：照着手跑一遍在参考一下别人的博客就很清楚了。

code：

string Manacher(string s){
	// Insert '#'
	string t="$#";
	for(int i=0;i<s.size();++i){
		t+=s[i];t+='#';
	}
	//Process t
	vector<int> p(t.size(),0);
	int mx=0,id=0,resLen=0,resCenter=0;
	for(int i=1;i<t.size();++i){
		p[i]=mx>i?min(p[2*id-i],mx-i):1;
		while(t[i+p[i]]==t[i-p[i]])	++p[i];
		if(mx<i+p[i]){
			mx=i+p[i];
			id=i;
		}
		if(resLen<p[i]){
			resLen=p[i];
			resCenter=i;
		}
	}return s.substr((resCenter-resLen)/2,resLen-1);//copy str-end:(str,len)
}

int main(){
	string s1="12212";
	cout<<Manacher(s1)<<endl;
	s1="122122";
	cout<<Manacher(s1)<<endl;
	s1="waabwswfd";
	cout<<Manacher(s1)<<endl;
}

然后用hihocoder的一道题来验证一下：

hihoCoder-#1032-最长回文子串（板子）

题目链接：http://hihocoder.com/problemset/problem/1032

AC：

// luogu-judger-enable-o2
//#pragma comment(linker, "/STACK:1024000000,1024000000")
  
#include<stdio.h>
#include<string.h> 
#include<math.h> 
   
//#include<map>  
#include<set>
#include<deque> 
#include<queue> 
#include<stack> 
#include<bitset>
#include<string> 
#include<fstream>
#include<iostream> 
#include<algorithm> 
using namespace std; 
  
#define ll long long 
#define Pair pair<int,int>
//#define max(a,b) (a)>(b)?(a):(b)
//#define min(a,b) (a)<(b)?(a):(b)
#define clean(a,b) memset(a,b,sizeof(a))// 水印
//std::ios::sync_with_stdio(false);
//  register
const int MAXN=1e5+10;
const int INF32=0x3f3f3f3f;
const ll INF64=0x3f3f3f3f3f3f3f3f;
const int mod=998244353;
const double PI=acos(-1.0);

int Manacher(string s){
	// Insert '#'
	string t="$#";
	for(int i=0;i<s.size();++i){
		t+=s[i];t+='#';
	}
	//Process t
	vector<int> p(t.size(),0);
	int mx=0,id=0,resLen=0,resCenter=0;
	for(int i=1;i<t.size();++i){
		p[i]=mx>i?min(p[2*id-i],mx-i):1;
		while(t[i+p[i]]==t[i-p[i]])	++p[i];
		if(mx<i+p[i]){
			mx=i+p[i];
			id=i;
		}
		if(resLen<p[i]){
			resLen=p[i];
			resCenter=i;
		}
	}//return s.substr((resCenter-resLen)/2,resLen-1);//copy str-end:(str,len)
	return resLen-1;
}

int main(){
	string s1;int n;
	cin>>n;
	for(int i=1;i<=n;++i){
		cin>>s1;cout<<Manacher(s1)<<endl;
	}
}


/*

*/