【bzoj2084】Antisymmetry manacher

AC通道：http://www.lydsy.com/JudgeOnline/problem.php?id=2084

【题解】

我们要求反对称的子串个数，只需要定义'#'='#'，'0'='1'，'0'≠'1'，'1'≠'0'，然后求回文子串个数即可。

直接上manacher，时间复杂度O(n)

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
#define FILE "read"
#define MAXN 1000010
#define up(i,j,n) for(int i=j;i<=n;++i)
#define dn(i,j,n) for(int i=j;i>=n;--i)
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
char a[MAXN],b[MAXN];
int n,ans,len[MAXN];
bool check(char x,char y){return (x=='#'&&y=='#')||(x=='1'&&y=='0')||(x=='0'&&y=='1');}
void init(){
	scanf("%d",&n); scanf("%s",a+1);
	up(i,1,n) b[i*2-1]='#',b[i*2]=a[i];
	b[0]='&'; b[n*2+1]='#';b[n*2+2]='*';
	n=n*2+1;
}
void manacher(){
	int po(0),mx(0);
	up(i,1,n){
		len[i]=mx>i?min(mx-i,len[po*2-i]):0;
		while(check(b[i-len[i]],b[i+len[i]])) len[i]++;
		if(len[i]+i>mx) mx=len[i]+i,po=i;
		ans+=len[i]>>1;
	}
	printf("%d\n",ans);
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	init();
	manacher();
	return 0;
}