【BZOJ-4636】蒟蒻的数列 动态开点线段树 ||（离散化） + 标记永久化

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int read()
{
    int x=0,f=1; char ch=getchar();
    while (ch<‘0‘ || ch>‘9‘) {if (ch==‘-‘) f=-1; ch=getchar();}
    while (ch>=‘0‘ && ch<=‘9‘) {x=x*10+ch-‘0‘; ch=getchar();}
    return x*f;
}
int N,a,b,K;
long long ans;
#define MAXN 50000
struct SegmentTreeNode
{
    int data[MAXN<<8],son[MAXN<<8][2],root,sz;
    void Insert(int &rt,int l,int r,int L,int R,int x)
        {
            if (L>R) return;
            if (!rt) rt=++sz;
            if (l==L && R==r) {data[rt]=max(data[rt],x); return;}
            int mid=(l+r)>>1;
            if (R<=mid) Insert(son[rt][0],l,mid,L,R,x);
            else if (L>mid) Insert(son[rt][1],mid+1,r,L,R,x);
            else Insert(son[rt][0],l,mid,L,mid,x),Insert(son[rt][1],mid+1,r,mid+1,R,x);
        }
    void Query(int rt,int l,int r,int x)
        {
            if (!rt) return;
            data[rt]=max(data[rt],x);
            if (!son[rt][0] && !son[rt][1]) {ans+=(long long)((r-l+1)*data[rt]); return;}
            int mid=(l+r)>>1;
            Query(son[rt][0],l,mid,data[rt]),Query(son[rt][1],mid+1,r,data[rt]);
            if (!son[rt][0]) ans+=(long long)((mid-l+1)*data[rt]);
            if (!son[rt][1]) ans+=(long long)((r-mid)*data[rt]);
        }
}SegTree;
#define INF (int)1e9
void Freopen() {freopen("sequence.in","r",stdin);freopen("sequence.out","w",stdout);}
void Fclose() {fclose(stdin);fclose(stdout);}
int main()
{
    //Freopen();
    N=read();
    while (N--)
        a=read(),b=read(),K=read(),
        SegTree.Insert(SegTree.root,1,INF,a,b-1,K);
    SegTree.Query(SegTree.root,1,INF,0);
    printf("%lld\n",ans);
    return 0;
}