思路
分别求两个方向的字符串hash,利用区间hash判断两子串是否满足回文
p.s.区间hash求法
代码
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll ;
typedef unsigned long long ull ;
const int inf = 0x3f3f3f3f;
const int N = 110000 + 10 ;
const ull base = 131 ;
ull p[N], rh[N], lh[N] ;
char s[N] ;
ull get1(int l , int r ){
return lh[r] - lh[l-1]*p[r-l+1] ;
}
ull get2(int l , int r ){
return rh[l] - rh[r+1]*p[r-l+1] ;
}
ull F(int ls , int rs , int maxn ){
ull l = 1 , r = maxn ;
while( l < r ){//二分查找1~maxn中最大长度
ull mid = l + r + 1 >> 1 ;
if(get1(ls-mid+1,ls) == get2(rs,rs+mid-1) ) l = mid ;
else r = mid - 1 ;
}
return l << 1 ;
}
int main() {
p[0] = 1 ;
for(int i = 1 ; i < N ; i ++ ) p[i] = p[i-1]*base ;//求base的次方
while(~scanf("%s",s+1)) {
int len = strlen(s+1) ;
lh[0] = rh[len+1] = 0 ;
for(int i = 1 ; i <= len ; i ++ ) lh[i] = lh[i-1]*base + s[i] ;
for(int i = len ; i >= 1 ; i -- ) rh[i] = rh[i+1]*base + s[i] ;
ull ans = 1 ;
for(int i = 1; i <= len ; i ++ ) {
if( i + 1 <= len && s[i] == s[i+1]) {
ans = max(ans, F(i,i+1,min(i,len-i))) ;
}
if(i + 1 <= len && i - 1 >= 1 && s[i-1] == s[i+1] ) {
ans = max(ans , F(i-1,i+1,min(i-1,len-i)) + 1 ) ;
}
}
printf("%lld\n",ans) ;
}
return 0;
}