【HDU5421】Victor and String（PAM）

传送门

---

题解：

双向加点PAM板子。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc getchar
#define cs const

inline char getalpha(){
	char c;
	while(!isalpha(c=gc()));return c;
}

using std::cerr;
using std::cout;

cs int N=1e5+5;

namespace PAM{
	char s[N<<1];int l=N,r=N-1,llast,rlast;
	int son[N][26],len[N],fa[N],now;
	int dep[N];ll ans;
	
	inline void init(){
		for(int re i=l;i<=r;++i)s[i]='\0';
		for(int re i=0;i<=now;++i){
			memset(son[i],0,sizeof son[i]);
			fa[i]=0,len[i]=0,dep[i]=0;
		}
		len[1]=-1,fa[0]=1;
		llast=rlast=0;
		now=1;l=N;r=N-1;ans=0;
	}
	
	inline void push_back(char c){
		s[++r]=c;c-='a';
		int p=rlast;
		while(s[r]!=s[r-len[p]-1])p=fa[p];
		if(!son[p][c]){
			len[++now]=len[p]+2;
			int k=fa[p];
			while(s[r]!=s[r-len[k]-1])k=fa[k];
			fa[now]=son[k][c],dep[now]=dep[fa[now]]+1;
			son[p][c]=now;
		}
		rlast=son[p][c];
		if(len[rlast]==r-l+1)llast=rlast;
		ans+=dep[rlast];
	}
	
	inline void push_front(char c){
		s[--l]=c;c-='a';
		int p=llast;
		while(s[l]!=s[l+len[p]+1])p=fa[p];
		if(!son[p][c]){
			len[++now]=len[p]+2;
			int k=fa[p];
			while(s[l]!=s[l+len[k]+1])k=fa[k];
			fa[now]=son[k][c],dep[now]=dep[fa[now]]+1;
			son[p][c]=now;
		}
		llast=son[p][c];
		if(len[llast]==r-l+1)rlast=llast;
		ans+=dep[llast];
	}
}

signed main(){
	int T;
//	freopen("string.in","r",stdin);
	while(~scanf("%d",&T)){
		PAM::init();
		while(T--){
			int t;
			scanf("%d",&t);
			switch(t){
				case 1:PAM::push_front(getalpha());break;
				case 2:PAM::push_back(getalpha());break;
				case 3:cout<<PAM::now-1<<"\n";break;
				case 4:cout<<PAM::ans<<"\n";break;
			}
		}
	}
	return 0;
}