bzoj 2084 反对称子串

回文串长度必须是偶数的manacher改一下匹配条件

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>

#define md
#define ll long long
#define inf (int) 1e9
#define eps 1e-8
#define N 500010
using namespace std;
int n; 
int p[N],a[N];
char st[N];
ll ans=0;
void manacher()
{
	int mx=0,id=0;
	for (int i=1;i<=n;i++)
	{
		if (i<=mx) p[i]=min(p[2*id-i],mx-i);
		  else p[i]=0;
		for (;a[i-p[i]]+a[i+p[i]+1]==1;p[i]++);
		if (i+p[i]>mx) { mx=p[i]; id=i;}
		ans+=p[i];
	}
}

int main()
{
	scanf("%d",&n);
	scanf("%s",st+1);
	for (int i=1;i<=n;i++) a[i]=st[i]-'0'; a[0]=233; a[n+1]=2333;
	manacher(); 
	printf("%lld\n",ans);
	return 0;
}