HDU-4614 Vases and Flowers 线段树区间更新

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

　　线段树保存区间是否被覆盖以及区间的和即可，在询问的时候在线段树上二分查找就可以了。。。代码写得比较挫><

//STATUS:C++_AC_359MS_1728KB
#include <functional>
#include <algorithm>
#include <iostream>
//#include <ext/rope>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
//using namespace __gnu_cxx;
//define
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1.0)
//typedef
typedef __int64 LL;
typedef unsigned __int64 ULL;
//const
const int N=50010,M=2000010;
const int INF=0x3f3f3f3f;
const int MOD=100000,STA=8000010;
const LL LNF=1LL<<60;
const double EPS=1e-8;
const double OO=1e15;
const int dx[4]={-1,0,1,0};
const int dy[4]={0,1,0,-1};
const int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
//Daily Use ...
inline int sign(double x){return (x>EPS)-(x<-EPS);}
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T lcm(T a,T b,T d){return a/d*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}
template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}
template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}
template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}
//End

int c[N<<2],sum[N<<2];
int T,n,m,a,b,tot,w;

void pushup(int rt)
{
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
    if(c[rt<<1]==c[rt<<1|1] && c[rt<<1]!=-1)c[rt]=c[rt<<1];
    else c[rt]=-1;
}

void pushdown(int rt,int l,int r,int mid)
{
    c[rt<<1]=c[rt<<1|1]=c[rt];
    sum[rt<<1]=(mid-l+1)*(!c[rt]);
    sum[rt<<1|1]=(r-mid)*(!c[rt]);
}

void build(int l,int r,int rt)
{
    if(l==r){
        sum[rt]=1;
        return;
    }
    int mid=(l+r)>>1;
    build(lson);
    build(rson);
    sum[rt]=r-l+1;
}

void update(int l,int r,int rt,int val)
{
    if(a<=l && r<=b){
        c[rt]=val;
        sum[rt]=(r-l+1)*(!val);
        return ;
    }
    int mid=(l+r)>>1;
    if(c[rt]!=-1)pushdown(rt,l,r,mid);
    if(a<=mid)update(lson,val);
    if(b>mid)update(rson,val);
    pushup(rt);
}

int query_sum(int l,int r,int rt)
{
    if(a<=l && r<=b){
        return sum[rt];
    }
    int mid=(l+r)>>1,tot=0;
    if(c[rt]!=-1)pushdown(rt,l,r,mid);
    if(a<=mid)tot+=query_sum(lson);
    if(b>mid)tot+=query_sum(rson);
    return tot;
}

void queryw(int l,int r,int rt)
{
    if(l==r){
        w=l;
        tot-=sum[rt];
        return;
    }
    int mid=(l+r)>>1;
    if(c[rt]!=-1)pushdown(rt,l,r,mid);
    if(sum[rt<<1]>=tot)queryw(lson);
    else if(mid<a || (sum[rt<<1]<tot && sum[rt<<1|1])){
        tot-=sum[rt<<1];
        queryw(rson);
    }
    else queryw(lson);
    pushup(rt);
}

int main()
{
 //   freopen("in.txt","r",stdin);
    int i,j,op,x,y;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        n--;
        mem(c,0);
        build(0,n,1);
        while(m--){
            scanf("%d%d%d",&op,&x,&y);
            if(op==1){
                tot=y;
                int t;
                if(x>0){
                    a=0,b=x-1;
                    t=query_sum(0,n,1);
                    tot+=t;
                }
                else t=0;
                a=x;
                queryw(0,n,1);
                if(tot==y)
                    printf("Can not put any one.
");
                else {
                    int en=w;
                    a=x;tot=t+1;
                    queryw(0,n,1);
                    printf("%d %d
",w,en);
                    a=w,b=en;
                    update(0,n,1,1);
                }
            }
            else {
                a=x,b=y;
                printf("%d
",b-a+1-query_sum(0,n,1));
                update(0,n,1,0);
            }
        }
        putchar('
');
    }
    return 0;
}