2084: [Poi2010]Antisymmetry
Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 567 Solved: 359
[ Submit][ Status][ Discuss]
Description
对于一个01字符串,如果将这个字符串0和1取反后,再将整个串反过来和原串一样,就称作“反对称”字符串。比如00001111和010101就是反对称的,1001就不是。
现在给出一个长度为N的01字符串,求它有多少个子串是反对称的。
Input
第一行一个正整数N (N <= 500,000)。第二行一个长度为N的01字符串。
Output
一个正整数,表示反对称子串的个数。
Sample Input
8
11001011
11001011
Sample Output
7
hint
7个反对称子串分别是:01(出现两次), 10(出现两次), 0101, 1100和001011
hint
7个反对称子串分别是:01(出现两次), 10(出现两次), 0101, 1100和001011
HINT
Source
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define N 500003
#define p 2000001001
#define ul unsigned long long
#define LL long long
using namespace std;
int a[N],b[N],n;
ul mi[N],sum[N],sum1[N];
char s[N];
bool pd(int pos,int x)
{
int t=x; int t1=n-(x-1)+1; ul b1,b2;
if (t>t1) b1=1,b2=mi[t-t1];
else b2=1,b1=mi[t1-t];
if ((sum[x+pos-1]-sum[x-1])*b1==(sum1[x-pos]-sum1[x])*b2) return true;
return false;
}
int main()
{
freopen("a.in","r",stdin);
freopen("my.out","w",stdout);
scanf("%d",&n); scanf("%s",s+1);
for (int i=1;i<=n;i++)
a[i]=s[i]-'0',b[i]=a[i]^1;
mi[0]=1;
for (int i=1;i<=n;i++) mi[i]=mi[i-1]*p;
for (int i=1;i<=n;i++)
sum[i]=sum[i-1]+mi[i]*a[i];
for (int i=n;i>=1;i--)
sum1[i]=sum1[i+1]+mi[n-i+1]*b[i];
//for (int i=1;i<=n;i++) cout<<sum[i]<<" "; cout<<endl;
//for (int i=1;i<=n;i++) cout<<sum1[i]<<" "; cout<<endl;
LL tot=0;
for (int i=1;i<=n;i++) {
int l=0; int r=min(i-1,n-i+1); int ans=0;
while (l<=r) {
int mid=(l+r)/2;
if (pd(mid,i)) ans=max(ans,mid),l=mid+1;
else r=mid-1;
}
tot+=(LL)ans;
}
printf("%I64d\n",tot);
}