bzoj 3196 二逼平衡树【树套树】

线段树套平衡树嘛…
其实窝 T 了吧23333

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<ctime>
#include<cmath>
#include<string>
#include<cstring>
#define lc(x) son[x][0]
#define rc(x) son[x][1]
#define N 50001
#define INF 100000000
using namespace std;

int n,m,tot;
int root[N << 2],a[N];
int size[N * 60],son[N * 60][2],key[N * 60],num[N * 60],w[N * 60];

void update(int x)
{
    size[x] = size[lc(x)] + size[rc(x)] + num[x];
}

void rotate(int &x,int t)
{
    int y = son[x][t];
    son[x][t] = son[y][t ^ 1];
    son[y][t ^ 1] = x;
    update(x);
    update(y);
    x = y;
}

void insert(int &x,int k)
{
    if (!x)
    {
        key[x = ++ tot] = k;
        w[x] = rand() + 1;
        num[x] = size[x] = 1;
        return;
    }
    if (key[x] == k) {num[x] ++,size[x] ++;return;}
    int t = key[x] < k;
    insert(son[x][t],k);
    if (w[son[x][t]] > w[x])
        rotate(x,t);
    update(x);
}

void remove(int &x,int k)
{
    if (key[x] == k)
    {
        if (num[x] > 1) num[x] --;
        else
        {
            if (!lc(x) && !rc(x)) {x = 0;return;}
            rotate(x,w[lc(x)] < w[rc(x)]);
            remove(x,k);
        }
    }
    else
        remove(son[x][key[x] < k],k);
    update(x);
}

void add(int x,int y)
{
    int l = 1,r = n,v = 1;
    while (true)
    {
        insert(root[v],y);
        if (l == r) return;
        int mid = l+r >> 1;
        if (x <= mid) v <<= 1,r = mid;
            else v = v << 1 | 1,l = mid + 1;
    }
}

void del(int x,int y)
{
    int l = 1,r = n,v = 1;
    while (true)
    {
        remove(root[v],y);
        if (l == r) return;
        int mid = l+r >> 1;
        if (x <= mid) v <<= 1,r = mid;
            else v = v << 1 | 1,l = mid + 1;
    }
}

int Rank(int x,int k)
{
    int ret = 0;
    while (x)
    {
        if (key[x] == k) return ret + size[lc(x)];
        if (key[x] < k) ret += size[lc(x)] + num[x],x = rc(x);
            else x = lc(x);
    }
    return ret;
}

int getrank(int v,int l,int r,int x,int y,int k)
{
    if (x <= l && r <= y) return Rank(root[v],k);
    int mid = l+r >> 1;int ret = 0;
    if (x <= mid) ret += getrank(v << 1,l,mid,x,y,k);
    if (mid < y) ret += getrank(v << 1 | 1,mid+1,r,x,y,k);
    return ret;
}

int getnum(int l,int r,int k)
{
    int L = 0,R = 2*INF;
    while (L < R-1)
    {
        int mid = (L/2+R/2+(L&R&1));
        if (getrank(1,1,n,l,r,mid-INF)>=k) R=mid;
            else L=mid;
    }
    return L-INF;
}

int Pre(int x,int k)
{
    int ret = 0;
    while (x)
        if (key[x] >= k) x = lc(x);
            else ret = max(ret,key[x]),x = rc(x);
    return ret;
}

int findpre(int v,int l,int r,int x,int y,int k)
{
    if (x <= l && r <= y) return Pre(root[v],k);
    int mid = l+r >> 1,ret = 0;
    if (x <= mid) ret = max(ret,findpre(v << 1,l,mid,x,y,k));
    if (mid < y) ret = max(ret,findpre(v << 1 | 1,mid+1,r,x,y,k));
    return ret;
}

int Next(int x,int k)
{
    int ret = INF;
    while (x)
        if (key[x] <= k) x = rc(x);
            else ret = min(ret,key[x]),x = lc(x);
    return ret;
}

int findsuf(int v,int l,int r,int x,int y,int k)
{
    if (x <= l && r <= y) return Next(root[v],k);
    int mid = l+r >> 1,ret = INF;
    if (x <= mid) ret = min(ret,findsuf(v << 1,l,mid,x,y,k));
    if (mid < y) ret = min(ret,findsuf(v << 1 | 1,mid+1,r,x,y,k));
    return ret;
}

int main()
{
    scanf("%d%d",&n,&m);
    for (int i = 1;i <= n;i ++) scanf("%d",&a[i]),add(i,a[i]);
    for (int l,r,k,opt;m --;)
    {
        scanf("%d",&opt);
        (opt ^ 3) ? scanf("%d%d%d",&l,&r,&k) : scanf("%d%d",&l,&k);
        switch (opt)
        {
            case 1 : printf("%d\n",getrank(1,1,n,l,r,k)+1);break;
            case 2 : printf("%d\n",getnum(l,r,k));break;
            case 3 : del(l,a[l]),add(l,a[l] = k);break;
            case 4 : printf("%d\n",findpre(1,1,n,l,r,k));break;
            case 5 : printf("%d\n",findsuf(1,1,n,l,r,k));break;
        }
    }

    return 0;
}