BZOJ 4636 蒟蒻的数列

二分写错了血T。。。。。

线段树标记永久化。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 200050
using namespace std;
struct move
{
    int l,r,p;
}mov[maxn];
int n,root,tot=,a[maxn],cnt=,x,y,z,len;
int ls[maxn<<],rs[maxn<<],mx[maxn<<];
long long ans=;
void build(int &now,int left,int right)
{
    now=++tot;mx[now]=;
    if (left==right) return;
    int mid=(left+right)>>;
    build(ls[now],left,mid);
    build(rs[now],mid+,right);
}
int find(int x)
{
    int l=,r=len;
    while (l<=r)
    {
        int mid=(l+r)>>;
        if (x==a[mid]) return mid;
        else if (x<a[mid]) r=mid-;
        else l=mid+;
    }
    return l;
}
void modify(int now,int left,int right,int l,int r,int p)
{
    if ((left==l) && (right==r))
    {
        mx[now]=max(mx[now],p);
        return;
    }
    int mid=(left+right)>>;
    if (r<=mid) modify(ls[now],left,mid,l,r,p);
    else if (l>=mid+) modify(rs[now],mid+,right,l,r,p);
    else
    {
        modify(ls[now],left,mid,l,mid,p);
        modify(rs[now],mid+,right,mid+,r,p);
    }
}
int ask(int now,int left,int right,int pos)
{
    if ((left==right) && (left==pos))
        return mx[now];
    int mid=(left+right)>>;
    if (pos<=mid) return max(mx[now],ask(ls[now],left,mid,pos));
    else return max(ask(rs[now],mid+,right,pos),mx[now]);
}
int main()
{
    scanf("%d",&n);
    for (int i=;i<=n;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        mov[i].l=x;mov[i].r=y;mov[i].p=z;
        a[++cnt]=x;a[++cnt]=y;
    }
    sort(a+,a+cnt+);
    len=unique(a+,a+cnt+)-a-;
    build(root,,len);
    for (int i=;i<=n;i++)
    {
        if (mov[i].l==mov[i].r) continue;
        modify(root,,len,find(mov[i].l),find(mov[i].r)-,mov[i].p);
    }
    for (int i=;i<=len-;i++)
        ans+=(long long)ask(root,,len,i)*(a[i+]-a[i]);
    printf("%lld\n",ans);
    return ;
}