Codeforce Round 524 F 可持久化线段树

好题 

#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10;
struct SegmentTree{
    int p,l,r,Max;
}T[N*20];
int cnt,R[N],n,m,k;
void insert(int &root,int l,int r,int x,int val){
    T[++cnt]=T[root];
    root=cnt;
    if(l==r){
        T[cnt].Max=max(T[cnt].Max,val);
        return;
    }
    int mid=(l+r)/2;
    if(x<=mid)insert(T[root].l,l,mid,x,val);
    else insert(T[root].r,mid+1,r,x,val);
    T[root].Max=min(T[T[root].l].Max,T[T[root].r].Max);
}
int query(int p,int l,int r,int x,int y){
    if(l>=x&&r<=y)return T[p].Max;
    int mid=(l+r)/2;
    int val=1<<30;
    if(x<=mid)val=min(val,query(T[p].l,l,mid,x,y));
    if(y>mid)val=min(val,query(T[p].r,mid+1,r,x,y));
    return val;
}
struct Interval{
    int l,r,p;
    friend bool operator<(const Interval &a,const Interval &b){return a.r<b.r;}
}A[N];
int main(){
    T[0].Max=-1;
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=k;++i)cin>>A[i].l>>A[i].r>>A[i].p;
    sort(A+1,A+1+k);
    for(int i=1;i<=k;++i)insert(R[i]=R[i-1],1,n,A[i].p,A[i].l);
    while(m--){
        int a,b,x,y;
        cin>>a>>b>>x>>y;
        int l=1,r=k;
        while(l<r){
            int mid=(l+r+1)/2;
            if(A[mid].r>y)r=mid-1;
            else l=mid;
        }
        if(A[l].r>y){
            cout<<"no"<<endl;
            fflush(stdout);
            continue;
        }
        int ans=query(R[l],1,n,a,b);
        if(ans>=x)cout<<"yes"<<endl;
        else cout<<"no"<<endl;
        fflush(stdout);
    }
}