HDU 4960 Handling the past 2014 多校9 线段树

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define LL __int64
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int N = 50010;
int sum[N<<2],rsum[N<<2];
int d[N<<2];
int q[N],A[N],tmp[N],t[N];
int n;
void build(int rt,int l,int r)
{
    sum[rt]=rsum[rt]=0;
    if (l>=r){
       return;
    }
    int mid=(l+r)>>1;
    build(lson);
    build(rson);
}
void up(int rt)
{
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
    rsum[rt]=max(rsum[rt<<1|1],sum[rt<<1|1]+rsum[rt<<1]);
}
void update(int val,int pos,int loc,int rt,int l,int r)
{
    if (l>=r){
        sum[rt]=val;
        rsum[rt]=val;
        if (val>0) d[rt]=A[loc];
        //if (val<0) rsum[rt]=0;
        return;
    }
    int mid=(l+r)>>1;
    if (pos<=mid)
    update(val,pos,loc,lson);
    else
    update(val,pos,loc,rson);
    up(rt);
}
int s;
int query(int pos,int rt,int l,int r)
{
    if (r<=pos){
        if (s+rsum[rt]<=0){
            s+=sum[rt];
            return -1;
        }
    }
    if (l>=r){
        return d[rt];
    }
    int mid=(l+r)>>1;
    if (pos<=mid) return query(pos,lson);
    int res=-1;
    res=query(pos,rson);
    if (res!=-1) return res;
    return query(pos,lson);

}
int main()
{
    char str[10];
    int kase=0;
    while (scanf("%d",&n)!=EOF)
    {
        if (n==0) break;
        for (int i=1;i<=n;i++){
            scanf("%s",str);
            if (str[1]==‘u‘){
                q[i]=1;
                scanf("%d%d",&A[i],&tmp[i]);
            }
            else
            if (str[1]==‘o‘){
                q[i]=2;
                scanf("%d",&tmp[i]);
            }
            else{
                q[i]=3;
                scanf("%d",&tmp[i]);
            }
            t[i]=tmp[i];
        }
        printf("Case #%d:\n",++kase);
        sort(t+1,t+1+n);
        for (int i=1;i<=n;i++){
            int pos=lower_bound(t+1,t+1+n,tmp[i])-t;
            tmp[i]=pos;
            //cout<<tmp[i]<<endl;
        }
        build(1,1,n);
        for (int i=1;i<=n;i++){
            if (q[i]==1){
                update(1,tmp[i],i,1,1,n);
            }
            else
            if (q[i]==2){
                update(-1,tmp[i],i,1,1,n);
            }
            else{
                if (tmp[i]<=1){
                 printf("-1\n");
                 continue;
                }
                s=0;
                int ans=query(tmp[i]-1,1,1,n);
                printf("%d\n",ans);
            }
        }
    }
    return 0;
}