CodeForces 570C Replacement 线段树

题目链接：http://codeforces.com/problemset/problem/570/C

单点更新区间的状态，并记录下每一个子区间左边,右边有多少个’.’，合并的时候要注意一下就可以了

代码：

#include <bits/stdc++.h>
#define sf scanf
#define pf printf

using namespace std;
const int maxn = 300000 + 50;
//SegTree
#define lson rt << 1,l,mid
#define rson rt << 1 | 1,mid + 1,r
#define totNode maxn * 4
int ch[totNode][2],leftCnt[totNode],rightCnt[totNode],v[totNode];
bool Ar[maxn];
void PushUp(int rt,int l,int r){
    int ls = rt << 1,rs = rt << 1 | 1,mid = l + r >> 1;
    int lcnt = mid - l + 1,rcnt = r - mid;

    v[rt] = v[ls] + v[rs];
    if(rightCnt[ls]) v[rt] -= rightCnt[ls] - 1;
    if(leftCnt[rs]) v[rt] -= leftCnt[rs] - 1;
    if(rightCnt[ls] + leftCnt[rs]) v[rt] += rightCnt[ls] + leftCnt[rs] - 1;
    if(leftCnt[ls] == lcnt) leftCnt[rt] = leftCnt[ls] + leftCnt[rs];
    else leftCnt[rt] = leftCnt[ls];
    if(rightCnt[rs] == rcnt)rightCnt[rt] = rightCnt[rs] + rightCnt[ls];
    else rightCnt[rt] = rightCnt[rs];
}
void Init_SegTree(int rt,int l,int r){
    if(l == r){
        if(Ar[l]) v[rt] = 0,leftCnt[rt] = rightCnt[rt] = 1;
        else v[rt] = 0,leftCnt[rt] = rightCnt[rt] = 0;
        return;
    }
    int mid = l + r >> 1;
    Init_SegTree(lson),Init_SegTree(rson);
    PushUp(rt,l,r);
}

void Update(int rt,int l,int r,int x,bool st){
    if(l == r){
        if(st) v[rt] = 0,leftCnt[rt] = rightCnt[rt] = 1;
        else v[rt] = leftCnt[rt] = rightCnt[rt] = 0;
        return;
    }
    int mid = l + r >> 1;
    if(x <= mid) Update(lson,x,st);
    else Update(rson,x,st);
    PushUp(rt,l,r);
}

char tmp;
int main(){
    int n,m;
    sf("%d %d",&n,&m);
    getchar();
    for(int i = 1;i <= n;++i){
        tmp = getchar();
        if(tmp == '.') Ar[i] = 1;
        else Ar[i] = 0;
    }
    Init_SegTree(1,1,n);
    while(m--){
        int i;sf("%d %c",&i,&tmp);
        if(tmp == '.') Update(1,1,n,i,1);
        else Update(1,1,n,i,0);
        pf("%d\n",v[1]);
    }
}