day 1 晚上 P2824 [HEOI2016/TJOI2016]排序 线段树

 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cmath>
 #include<cstring>
 using namespace std;
 const int maxn=1e6+;

 struct node
 {
     int l;
     int r;
     int value;
     int lazy;
 }tree[maxn];
 int q;
 struct tre
 {
     int a,b,c;
 }o[maxn];
 int n,m;
 int lllll;
 int a[maxn];
 void pushup(int  x)
 {
     tree[x].value=tree[x<<].value+tree[x<<|].value;
 }

 void pushdown(int x)
 {
     if(tree[x].lazy!=-)
     {
         tree[x<<].lazy=tree[x].lazy;
         tree[x<<|].lazy=tree[x].lazy;
         tree[x<<].value=(tree[x<<].r-tree[x<<].l+)*tree[x].lazy;
         tree[x<<|].value=(tree[x<<|].r-tree[x<<|].l+)*tree[x].lazy;
         tree[x].lazy=-;
     }
     if(tree[x].l<tree[x].r)
     {
         pushup(x);
     }
 }
 void build(int x,int l,int r)
 {
     tree[x].l=l;
     tree[x].r=r;
     tree[x].lazy=-;
     if(l==r)
     {
         tree[x].value=a[l]>lllll;
         return ;
     }
     int mid=(l+r)>>;
     build(x<<,l,mid);
     build(x<<|,mid+,r);
     pushup(x);
 }
 int query(int x,int ls,int rs)
 {
     int l=tree[x].l;
     int r=tree[x].r;
     int mid=(l+r)>>;
     pushdown(x);
     if(ls<=l&&r<=rs)
     {
         return tree[x].value;
     }
     int ans=;
     if(ls<=mid)
     {
         ans+=query(x<<,ls,rs);
     }
     if(rs>mid)
     {
         ans+=query(x<<|,ls,rs);
     }
     return ans;
 }
 void modify(int x,int ls,int rs,int c)
 {
     int l=tree[x].l;
     int r=tree[x].r;
     int mid=(l+r)>>;
     pushdown(x);
     if(ls<=l&&r<=rs)
     {
         tree[x].value=(r-l+)*c;
         tree[x].lazy=c;
         return ;
     }
     if(ls<=mid)
     {
         modify(x<<,ls,rs,c);

     }
     if(rs>mid)
     {
         modify(x<<|,ls,rs,c);
     }
     pushup(x);
 }
 bool check(int x)
 {
     lllll=x;
     build(,,n);
     for(int i=;i<=m;i++)
     {
         int opt=o[i].a;
         int x=o[i].b;
         int y=o[i].c;
         int tmp=query(,x,y);
         if (opt == )
         {
               modify(,x,y-tmp,);
               modify(,y-tmp+,y,);
         }
         else
         {
               modify(,x,x+tmp-,);
               modify(,x+tmp,y,);
         }
     }
     return !query(,q,q);
 }
 int main()
 {
     cin>>n>>m;
     for(int i=;i<=n;i++)
     {
         cin>>a[i];
     }
     for(int i=;i<=m;i++)
     {
         cin>>o[i].a>>o[i].b>>o[i].c;
     }
     cin>>q;
     int l=;
     int r=n;
     while(l<r)
     {
         int mid=l+(r-l)/;
         if(check(mid))
         {
             r=mid;
         }
         else
         {
             l=mid+;
         }
     }
     cout<<r<<endl;
     return ;
 }