题目链接:http://hihocoder.com/problemset/problem/1602
解题思路:
跑马拉车的时候,对于单个字母单独考虑,然后匹配过程中,我们不管开始匹配未知位置之前的(代码74行),因为那一部分回文已经被统计过了,我们只需统计未匹配过的(代码77行),这其中可能有部分之前出现过,我们用哈希表去重一下。
如何利用哈希表去重?https://blog.csdn.net/weixin_43768644/article/details/97614712
PS:本质不同回文串最多 = 长度,可以网上搜搜证明
代码:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<map>
#include<set>
using namespace std;
#define ll long long
#define for1(i,a,b) for (int i=a;i<=b;i++)
#define for0(i,a,b) for (int i=a;i<b;i++)
#define pb push_back
#define fi first
#define se second
#define debug(x) printf("----Line %s----\n",#x)
#define pt(x,y) printf("%s = %d\n",#x,y)
#define INF 0x3f3f3f3f
#define ull unsigned long long
const int N = 3e5+5;
const int hashsize = 6e5+5;
const ll P = 311;
char s[N];
char tmp[N<<1];
int Len[N<<1];
int ans;
ull hsh[N],p[N];
struct hashtable
{
ull val;
int last;
}edge[hashsize+5];///估计会有多少本质不同的回文串
int head[hashsize+5],id;///开的大点查询是否存在快点
void insert(int l,int r)
{
ull now = hsh[r]-hsh[l-1]*p[r-l+1];
ll pos = now%hashsize;
for (int i = head[pos];i!=0;i=edge[i].last)
if (edge[i].val == now){
return ;
}
ans ++;
edge[id].val = now;
edge[id].last = head[pos];
head[pos] = id++;
}
int INIT(char *st)
{
int i,len=strlen(st);
tmp[0]='@';
for(i=1;i<=2*len;i+=2)
{
tmp[i]='#';
tmp[i+1]=st[i/2];
}
tmp[2*len+1]='#';
tmp[2*len+2]='$';
tmp[2*len+3]=0;
return 2*len+1;
}
void MANACHER(char *st,int len)
{
int mx=0,po=0;
for(int i=1;i<=len;i++)
{
if (!(i&1)) insert(i/2,i/2);
if(mx>i) Len[i]=min(mx-i,Len[2*po-i]);
else Len[i]=1;
while(st[i-Len[i]]==st[i+Len[i]]){
Len[i]++;
if (i%2==0 && Len[i]&1){
int sb = Len[i]/2;
int l = i/2-sb;
int r = i/2+sb;
if (l==r) continue;
insert(l,r);
}
else if (i&1 && !(Len[i]&1)){///反正进来的Len都大于1
int sb = Len[i]/2;
int l = i/2-sb+1;
int r = i/2+sb;
insert(l,r);
}
}
if(Len[i]+i>mx)
{
mx=Len[i]+i;
po=i;
}
}
}
void init()
{
id = 1;
p[0] = 1;
memset(head,0,sizeof head);
ans = 0;
}
int main()
{
while (~scanf("%s",s)){
init();
int len = strlen(s);
for (int i=1;i<=len;i++){
hsh[i] = hsh[i-1]*P + s[i-1];
if (!p[i]) p[i] = p[i-1]*P;
}
int llen = INIT(s);
MANACHER(tmp,llen);
printf("%d\n",ans);
}
return 0;
}