hdu 4614 线段树

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4614

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>

#define maxn 105000
#define lson l,mid,u<<1
#define rson mid+1,r,u<<1|1
using namespace std;

int seg[maxn<<2];
int pau[maxn<<2];

void PushDown(int l,int r,int u){
    if(pau[u] == 1){
        pau[u<<1] = pau[u<<1|1] = 1;   
        int mid = (l + r)>>1;
        seg[u<<1]   = (mid - l + 1);
        seg[u<<1|1] = (r - mid);
        pau[u] = -1 ;
    }
    else if(pau[u] == 0){
        pau[u<<1] = pau[u<<1|1] = 0;   
        int mid = (l + r)>>1;
        seg[u<<1]   = 0;
        seg[u<<1|1] = 0;
        pau[u] = -1 ;
    }
}
void PushUp(int u){
    seg[u] = seg[u<<1] + seg[u<<1|1];
}
void build(int l,int r,int u){
    pau[u] = -1;
    seg[u] = 0; 
    if(l == r){
        return;
    }
    int mid = (l + r)>>1;
    build(lson);
    build(rson);
}
void Update(int L,int R,int num,int l,int r,int u){
    if(L <= l && r <= R){
        pau[u] = num;
        seg[u] =(r - l + 1)*num;
        return;
    }
    PushDown(l,r,u);
    int mid = (l + r)>>1;
    if(L <= mid)    Update(L,R,num,lson);
    if(R >  mid)    Update(L,R,num,rson);
    PushUp(u);
}
int  Query(int L,int R,int l,int r,int u){
    if(L <= l && r <= R){
        return seg[u];
    }
    PushDown(l,r,u);
    int mid = (l + r)>>1;
    int ret = 0;
    if(L <= mid)  ret += Query(L,R,lson);
    if(R >  mid)  ret += Query(L,R,rson);
    return ret;
}
int bin_ser(int L,int R,int num,int N){ 
   //搜索0在L~R中第num次出现的位置； 
    int start = L;
    while(L < R){
        int mid = (L + R)/2;
        int temp = Query(start,mid,0,N-1,1);
        if(mid - start + 1 >= temp + num )
           R = mid;
        else
           L = mid + 1;  
    }
    return L;
}
int main()
{
    if(freopen("input.txt","r",stdin)== NULL)  {printf("Error
"); exit(0);}
    int T;
    cin>>T; 
    int N,M,K;
    while(T--){
        scanf("%d%d",&N,&M);
        //build(0,N-1,1);    
        memset(pau,-1,sizeof(pau)); 
        memset(seg,0,sizeof(seg));   //两种方法都可以；都要写对。没想到会犯低级错害的Wa 
        for(int i=1;i<=M;i++){
            int a,b;
            int s,t;
            scanf("%d%d%d",&K,&a,&b);
            if(K == 1){  
               int right_sum =Query(a,N-1,0,N-1,1); //printf("res %d
",res);
               if(right_sum == N - a){
                     printf("Can not put any one.
");
                  }
               else{
                     int left_sum  = a==0 ? 0 : Query(0,a-1,0,N-1,1);
                  s = bin_ser(0,N-1,a-left_sum+1,N);
                    t = bin_ser(a,N-1,min(N - a - right_sum, b),N);
                     
                     printf("%d %d
",s,t);
                     Update(s,t,1,0,N-1,1);
               }
            }
            else{
               printf("%d
",Query(a,b,0,N-1,1));
               Update(a,b,0,0,N-1,1);    
            } 
        }
        printf("
");
    }
}