回文树学习

sky_48

于 2019-09-09 21:33:56 发布

阅读量148

点赞数

CC 4.0 BY-SA版权

分类专栏：回文树文章标签：学习笔记

本文链接：https://blog.csdn.net/sky_48/article/details/100676076

回文树专栏收录该内容

1 篇文章

订阅专栏

回文树学习

代码是模仿ctl学长的。ctlnb！！！
https://blog.csdn.net/u013368721/article/details/42100363 推荐博客

/*
  user: sky48
  language: c++
  for dream for young
*/
#include<iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define N 300005
typedef long long ll;
using namespace std;
int cnt[N],len[N],fail[N],s[N],to[N][30];
ll ans;
char ch[N];
int tot,n,L,last;
int gets()
{
	int v=0; char ch;bool f=0;
	while(!isdigit(ch=getchar())) if(ch=='-') f=1; v=ch-48;
	while( isdigit(ch=getchar())) v=(v<<1)+(v<<3)+ch-48;
	return f?-v:v;
}
void add(int c){
	s[++n]=c;
	int cur,tmp,now;
	for(cur=last;s[n-len[cur]-1]!=s[n];cur=fail[cur]);
	if(!to[cur][c]){
		len[++tot]=len[cur]+2; now=tot;
		for(tmp=fail[cur];s[n-len[tmp]-1]!=s[n];tmp=fail[tmp]);
		fail[now]=to[tmp][c]; 
		to[cur][c]=now;
		
	}last=to[cur][c];
	cnt[last]++; 
	
}
int main ()
{
//  freopen("tt.txt","r",stdin);
	scanf("%s",ch); L=strlen(ch);
	len[tot]=0, len[++tot]=-1;
	fail[0]=1, fail[1]=1, s[0]=-1; 
	rep(i,0,L-1) add(ch[i]-'a'); 
	for(int i=tot;i>=2;i--) cnt[fail[i]]+=cnt[i];
	rep(i,2,tot) ans=max(ans,(ll)cnt[i]*len[i]);
	printf("%lld\n",ans);
	
	return 0;
}