HDU1540

http://acm.hdu.edu.cn/showproblem.php?pid=1540

这题明摆着是线段树的区间合并

但是我感觉二分更优雅

所以我二分加树状数组

配上读入挂

700msA了

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5; 
inline void read(int &x){char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok) x=-x;}
int c[N];
int lowbit(int i){return i&(-i);}
void add(int i,int value){while(i<=N){c[i]+=value;i+=lowbit(i);}}
int sum(int i){int sum=0;while(i>0){sum+=c[i];i-=lowbit(i);}return sum;}
bool check(int l,int r){
    return r-l+1==sum(r)-sum(l-1);
}
int main(){
    int n,m;
    while(cin>>n>>m){
        stack<int> st;
        memset(c,0,sizeof c);
        for(int i=1;i<=n;++i)
            add(i,1);
        while(m--){
            char s[3];
            int a;
            scanf("%s",s);
            if(s[0]=='D'){
                read(a);
                if(sum(a)-sum(a-1)==1)
                    add(a,-1);
                st.push(a);
            }
            if(s[0]=='Q'){
                read(a);
                if(sum(a)-sum(a-1)==0){
                    cout<<0<<endl;
                    continue;
                }
                int l=1,r=a;
                while(l<r){
                    int mid=(l+r)/2;
                    if(check(mid,a))
                        r=mid;
                    else
                        l=mid+1;
                }
                int ans=a-l;
                l=a,r=n;
                while(l<r){
                    int mid=(l+r+1)/2;
                    if(check(a,mid)){
                        l=mid;
                    }
                    else
                        r=mid-1;
                }
                ans+=l-a;
                printf("%d\n",ans+1);
            }
            //13
            if(s[0]=='R'){
                if(sum(st.top())-sum(st.top()-1)==0)
                add(st.top(),1);
                st.pop();
            }
        }
    }
}