[HEOI2016/TJOI2016]排序

题目链接：点这里
题解：01序列+线段树。
这个题我们要离线的写，首先我们要二分答案，得到mid以后将所以小于mid的位置为0，大于等于mid的为1。然后我们建立一个线段树，在上面进行离线操作，每次排序就是把这个区间里的0和1换一下位置，这在线段树上是很容易实现的。如果第p个位置为1的话代表当前这个位置的数应该小于等于mid，满足单调性，然后我们再继续进行二分即可。

#include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
#define ios ios::sync_with_stdio(false)
#define CRL(a) memset(a,0,sizeof a)
#define endl "\n"

using namespace std;

const int maxn = 2e5 + 5;
int n, m, anss;
int x[maxn];
int d[maxn];
struct node
{
    int val, l, r, lazy;
} e[maxn * 2];
struct node1
{
    int da, l, r;
} f[maxn];
void pushdown(int t)
{
    if(e[t].lazy<0)
        return;
    e[t * 2].val = (e[t * 2].r - e[t * 2].l + 1) * e[t].lazy;
    e[t * 2 + 1].val = (e[t * 2 + 1].r - e[t * 2 + 1].l + 1) * e[t].lazy;
    e[t * 2].lazy = e[t].lazy;
    e[t * 2 + 1].lazy = e[t].lazy;
    e[t].lazy = -1;
}
void build(int l,int r,int t)
{
    e[t].l = l, e[t].r = r;
    e[t].lazy = -1;
    if(l==r)
    {
        e[t].val = d[l];
        return;
    }
    int mid = e[t].r + e[t].l >> 1;
    build(l, mid, t * 2);
    build(mid + 1, r, t * 2 + 1);
    e[t].val = e[t * 2].val + e[t * 2 + 1].val;
}
void change(int l,int r,int t,int data)
{
    if(l<=e[t].l&&e[t].r<=r)
    {
        e[t].val = data * (e[t].r - e[t].l + 1);
        e[t].lazy = data;
        return;
    }
    pushdown(t);
    int mid = e[t].l + e[t].r >> 1;
    if(l<=mid)
        change(l, r, t * 2, data);
    if(r>mid)
        change(l, r, t * 2 + 1, data);
    e[t].val = e[t * 2].val + e[t * 2 + 1].val;
}
int solve(int l,int r,int t)
{
    if(l<=e[t].l&&e[t].r<=r)
    {
        return e[t].val;
    }
    pushdown(t);
    int ans = 0;
    int mid = e[t].l + e[t].r >> 1;
    if(l<=mid)
        ans += solve(l, r, t * 2);
    if(r>mid)
        ans += solve(l, r, t * 2 + 1);
    return ans;
}
bool judge(int a)
{
    for (int i = 1; i <= n;i++)
    {
        if(x[i]<a)
            d[i] = 0;
        else d[i]=1;
    }
    build(1, n, 1);
    for (int i = 1; i <= m;i++)
    {
        if(f[i].da==0)
        {
            int b = solve(f[i].l, f[i].r, 1);
            //cout << b << endl;
            change(f[i].l, f[i].r - b, 1, 0);
            change(f[i].r - b + 1, f[i].r, 1, 1);
        }
        else 
        {
            int b = solve(f[i].l, f[i].r, 1);
           // cout << b << endl;
            change(f[i].l, f[i].l + b-1, 1, 1);
            change(f[i].l + b, f[i].r, 1, 0);
        }
    }
    if(solve(anss,anss,1)==1)
        return true;
    return false;
}
int main()
{ 
    cin >> n >> m;
    for (int i = 1; i <= n;i++)
    {
        cin >> x[i];
    }
    for (int i = 1;i<=m;i++)
    {
        cin >> f[i].da >> f[i].l >> f[i].r;
    }
    cin >> anss;
    int l = 1, r = n;
    int sum;
    while(l<=r)
    {
        int mid = l + r >> 1;
        if(judge(mid))
        {
            //cout << mid << endl;
            l = mid + 1;
            sum = mid;
        }
        else 
        {
            r = mid - 1;
        }
    }
    cout << sum;
}