manacher求出所有极长回文串的左右端点,然后求最少几段区间能覆盖整个串即可
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 100010
#define MAXM 1010
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
struct itv{
int l;
int r;
friend bool operator <(itv x,itv y){
return x.r<y.r;
}
};
int n;
char s[MAXN];
int f[MAXN];
itv a[MAXN];
int tot;
int v[MAXN<<2];
inline void ud(int x){
v[x]=min(v[x<<1],v[x<<1|1]);
}
void build(int x,int y,int z){
if(y==z){
if(!y){
v[x]=-1;
}else{
v[x]=INF;
}
return ;
}
int mid=y+z>>1;
build(x<<1,y,mid);
build(x<<1|1,mid+1,z);
ud(x);
}
int ask(int x,int y,int z,int l,int r){
if(y==l&&z==r){
return v[x];
}
int mid=y+z>>1;
if(r<=mid){
return ask(x<<1,y,mid,l,r);
}else if(l>mid){
return ask(x<<1|1,mid+1,z,l,r);
}else{
return min(ask(x<<1,y,mid,l,mid),ask(x<<1|1,mid+1,z,mid+1,r));
}
}
void change(int x,int y,int z,int p,int cv){
if(y==z){
v[x]=cv;
return ;
}
int mid=y+z>>1;
if(p<=mid){
change(x<<1,y,mid,p,cv);
}else{
change(x<<1|1,mid+1,z,p,cv);
}
ud(x);
}
int main(){
int i;
while(scanf("%s",s+1)!=EOF){
n=strlen(s+1);
for(i=n;i;i--){
s[i<<1|1]='*';
s[i<<1]=s[i];
}
s[1]='*';
s[0]='$';
n=n<<1|1;
int mx=1,now=1;
for(i=1;i<=n;i++){
f[i]=min(f[now*2-i],mx-i);
for(;s[i-f[i]-1]==s[i+f[i]+1];f[i]++){
}
if(i+f[i]>mx){
mx=i+f[i];
now=i;
}
}
n>>=1;
tot=0;
for(i=1;i<=n;i++){
if(f[i<<1]){
tot++;
a[tot].r=i+f[i<<1]/2;
a[tot].l=i-f[i<<1]/2;
}
if(f[i<<1|1]){
tot++;
a[tot].r=i+f[i<<1|1]/2;
a[tot].l=i-f[i<<1|1]/2+1;
}
}
sort(a+1,a+tot+1);
build(1,0,n);
memset(f,0x3f,sizeof(f));
for(i=1;i<=tot;i++){
f[a[i].r]=min(f[a[i].r],ask(1,0,n,a[i].l-1,a[i].r-1)+1);
change(1,0,n,a[i].r,f[a[i].r]);
}
printf("%d\n",f[n]);
memset(s,0,sizeof(s));
}
return 0;
}
/*
*/