380C - Sereja and Brackets(思维+线段树)

https://codeforces.com/problemset/problem/380/C

---

开始自己看错题..当看对题了后，在括号匹配的基础上打线段树，发现不是单纯的求区间和。

参考：https://www.luogu.com.cn/blog/_post/287910

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e6+1000;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
struct Tree{
    LL l,r,Lsum,Rsum;///Lsum:无法匹配的'(';Rsum:无法匹配的')';
}tree[maxn*4];
void push_up(LL p){
     tree[p].Lsum=tree[p*2].Lsum+tree[p*2+1].Lsum-min(tree[p*2].Lsum,tree[p*2+1].Rsum);
     tree[p].Rsum=tree[p*2].Rsum+tree[p*2+1].Rsum-min(tree[p*2+1].Rsum,tree[p*2].Lsum);
}
void build(LL p,LL l,LL r){
     tree[p].l=l;tree[p].r=r;tree[p].Lsum=0;tree[p].Rsum=0;
     if(l==r){
        if(str[l]=='(') tree[p].Lsum=1;
        if(str[l]==')') tree[p].Rsum=1;
        return;
     }
     LL mid=(l+r)>>1;
     build(p*2,l,mid);build(p*2+1,mid+1,r);
     push_up(p);
}
Tree query(LL p,LL l,LL r){
    if(l<=tree[p].l&&r>=tree[p].r){
        return tree[p];
    }
    LL mid=(tree[p].l+tree[p].r)>>1;

    if(r<=mid) return query(p*2,l,r);
    if(l>mid) return query(p*2+1,l,r);
//    if(l<=mid) temp1=query(p*2,l,r);
//    if(r>mid) temp2=query(p*2+1,l,r);
    Tree temp1,temp2,ans;
    temp1=query(p*2,l,r);temp2=query(p*2+1,l,r);
    ans.Lsum=temp1.Lsum+temp2.Lsum-min(temp1.Lsum,temp2.Rsum);
    ans.Rsum=temp1.Rsum+temp2.Rsum-min(temp1.Lsum,temp2.Rsum);
    return ans;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   cin>>(str+1);LL n=strlen(str+1);
   build(1,1,n);
   LL m;cin>>m;
   while(m--){
      LL l,r;cin>>l>>r;
      Tree ans=query(1,l,r);
      cout<<r-l+1-(ans.Lsum+ans.Rsum)<<"\n";
   }
   return 0;
}