BZOJ[2084][Poi2010]Antisymmetry Manacher

题目链接http://www.lydsy.com/JudgeOnline/problem.php?id=2084

回文串首先会想到Manacher
但本题是让0和1匹配
把匹配条件改为一个1一个0，或两个#，跑Manacher即可
统计答案时要统计区间长度为偶数的，只需统计#作中点的就可以了

代码如下：

#include<algorithm>
#include<cstring>
#include<cstdio>
#define N 500200
using namespace std;
char s[N],str[N<<1];
int p[N<<1],len;
inline long long Manacher(){
    for(int i=1;i<=len*2;i+=2){
        str[i+1]=s[i/2];
        str[i]='#';
    }
    len=len*2+1;
    str[len]='#';
    int mx=0,id=0;
    long long tmp=0;
    for(int i=1;i<=len;i++){
        if(str[i]=='0' || str[i]=='1') continue;
        if(mx>=i) p[i]=min(mx-i,p[id*2-i]);
        else p[i]=0;
        while(str[i-p[i]-1]+str[i+p[i]+1]=='0'+'1' || (str[i-p[i]-1]=='#' && str[i+p[i]+1]=='#'))
            p[i]++;
        if(i+p[i]>mx) mx=i+p[i],id=i;
        tmp=tmp+p[i]/2;
    }
    return tmp;
}
int main(){
    scanf("%d%s",&len,s);
    printf("%lld",Manacher());
return 0;
}