回文字串-字符串哈希

回文子串-字符串哈希

前言

求解回文字串问题不仅可以用马拉车算法$(O(n))$，也可以用字符串哈希$(O(nlogn))$

解法

首先我们发现回文子串具有“单调性”，即如果$s[i...j]$为回文子串，那么$s[x...y]$也为回文子串$(i<x<y<j)$,因此我们枚举回文子串的中点，二分两边的长度，然后判断是否是回文子串即可，注意分奇偶两种情况求解(因为偶数类情况没有中点)

T1 SP7586

题解

求回文子串数裸题

代码实现

#include<bits/stdc++.h>//字符串哈希-回文子串 
#define LL unsigned long long
using namespace std;
LL mi[1009],has1[1009],has2[1009],ans;
int n;
char s[1009];
const int h=31;
LL gethas1(int x,int y){
	return has1[y]-has1[x-1]*mi[y-x+1];
}
LL gethas2(int x,int y){
	return has2[x]-has2[y+1]*mi[y-x+1];
}
LL query1(int x){//疑惑 
	int l=1,r=min(x,n-x);
	while(l<=r){
		int mid=(l+r)>>1;
		if(gethas1(x-mid,x+mid)==gethas2(x-mid,x+mid)) l=mid+1;
		else r=mid-1;
	}return r;
}
LL query2(int x){
	int l=1,r=min(x,n-x);
	while(l<=r){
		int mid=(l+r)>>1;
		if(gethas2(x-mid+1,x+mid)==gethas1(x-mid+1,x+mid)) l=mid+1;
		else r=mid-1;
	}return r;
}
int main(){
	scanf("%s",s+1);
	n=strlen(s+1),mi[0]=1;
	for(int i=1;i<=n;i++){
		has1[i]=has1[i-1]*h+(s[i]-'a');
		mi[i]=mi[i-1]*h;
	}for(int i=n;i>=1;i--) has2[i]=has2[i+1]*h+(s[i]-'a');
	for(int i=1;i<=n;i++)
		ans+=query1(i)+query2(i);
	printf("%llu\n",ans+n);
	return 0; 
} 

T2 LOJ2452

题目描述

题解

求类回文子串数，同样由单调性，故仍然可以使用字符串哈希求解

代码

#include<bits/stdc++.h>//字符串哈希-类回文哈希 
#define M 500009
#define LL unsigned long long
using namespace std;
LL mi[M],has1[M],has2[M],ans;
int n;
char s[M];
const int h=31;
LL gethas1(int x,int y){
	return has1[y]-has1[x-1]*mi[y-x+1];
}
LL gethas2(int x,int y){
	return has2[x]-has2[y+1]*mi[y-x+1];
}
LL query1(int x){
	int l=1,r=min(x,n-x);
	while(l<=r){
		int mid=(l+r)>>1;
		if(gethas1(x-mid,x+mid)==gethas2(x-mid,x+mid)) l=mid+1;
		else r=mid-1;
	}return r;
}
LL query2(int x){
	int l=1,r=min(x,n-x);
	while(l<=r){
		int mid=(l+r)>>1;
		if(gethas2(x-mid+1,x+mid)==gethas1(x-mid+1,x+mid)) l=mid+1;
		else r=mid-1;
	}return r;
}
int main(){
	scanf("%d",&n);
	scanf("%s",s+1);
	mi[0]=1;
	for(int i=1;i<=n;i++){
		has1[i]=has1[i-1]*h+s[i];
		mi[i]=mi[i-1]*h,s[i]^=1;
	}for(int i=n;i>=1;i--) has2[i]=has2[i+1]*h+s[i];
	for(int i=1;i<=n;i++)
		ans+=query1(i)+query2(i);
	printf("%llu\n",ans);
	return 0; 
}