LA4108&UVA1232 线段树

大体思路
维护区间最大值最小值，当新建的建筑物高度大于等于区间最大值时更新同时更新答案，小于最小值忽略.
(x+1是因为 区间1~5可以看成 2，3，4，5 四个点
只写x 更新会出错 是因为 更新1~10更新一遍10 更新10~15又会更新一遍10事实上只要更新一遍)

#include<bits/stdc++.h>

using namespace std;
const int maxn=1e5+10;
const int INF=999999999;
struct node
{
    int l,r,setv,maxn,minn;
    int mid(){return (l+r)>>1;}
}tree[maxn<<2];
int t,n,ans;
void build(int node,int l,int r)
{
    tree[node].l=l;tree[node].r=r;tree[node].setv=-1,tree[node].minn=0,tree[node].maxn=0;
    if(l==r) return;
    build(node<<1,l,tree[node].mid());
    build(node<<1|1,tree[node].mid()+1,r);
}
void pushdown(int node)
{
    if(tree[node].setv!=-1)
    {
        tree[node<<1].maxn=tree[node<<1|1].maxn=tree[node].setv;
        tree[node<<1].minn=tree[node<<1|1].minn=tree[node].setv;
        tree[node<<1].setv=tree[node<<1|1].setv=tree[node].setv;
        tree[node].setv=-1;
    }
}
void pushup(int node)
{
    tree[node].maxn=max(tree[node<<1].maxn,tree[node<<1|1].maxn);
    tree[node].minn=min(tree[node<<1].minn,tree[node<<1|1].minn);

}
void update(int node,int l,int r,int v)
{
    if(tree[node].minn>v) return ;
    if(tree[node].l==l&&tree[node].r==r)
    {
        if(tree[node].maxn<=v) {
            tree[node].setv=v;
            tree[node].maxn=tree[node].minn=v;
            ans+=r-l+1;
            return ;
        }
        if(l==r) return ;
    }
    pushdown(node);
    int mid=tree[node].mid();
    if(mid<l) {
        update(node<<1|1,l,r,v);
    }
    else if(mid>=r) {
        update(node<<1,l,r,v);
    }
    else {
        update(node<<1,l,mid,v);
        update(node<<1|1,mid+1,r,v);
    }
    pushup(node);
}
int main()
{
  //  freopen("in.txt","r",stdin);
   // freopen("out.txt","w",stdout);
    while(~scanf("%d",&t)&&t) {
        while(t--) {
            ans=0;
            build(1,1,maxn);
            scanf("%d",&n);
            int x,y,h;
            for(int _ = 0; _ < n; ++_) {
                scanf("%d%d%d",&x,&y,&h);
                update(1,x+1,y,h);
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}