bzoj3110: [Zjoi2013]K大数查询

题面在这里

题意：

有N个位置，M个操作。操作有两种，每次操作如果是1 a b c的形式表示在第a个位置到第b个位置，每个位置加入一个数c，如果是2 a b c形式，表示询问从第a个位置到第b个位置，第C大的数是多少。

做法：

权值线段树套区间线段树。呐应该很好理解。
我的第二棵树套树= =（第一棵是二逼平衡树）

代码：

/*************************************************************
    Problem: bzoj 3110 [Zjoi2013]K大数查询
    User: fengyuan
    Language: C++
    Result: Accepted
    Time: 14460 ms
    Memory: 396612 kb
    Submit_Time: 2017-12-31 23:29:18
*************************************************************/

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cctype>
#define mid (l+r>>1)
#define lc o<<1
#define rc o<<1|1
using namespace std;
typedef long long LL;

inline LL read()
{
    char ch = getchar(); LL x = 0; int op = 1;
    for (; !isdigit(ch); ch = getchar()) if (ch == '-') op = -1;
    for (; isdigit(ch); ch = getchar()) x = x*10+ch-'0';
    return op*x;
}
inline void writeAbs(LL a){ if (a >= 10) writeAbs(a/10); putchar('0'+a%10); }
inline void write(LL a){ if (a < 0) putchar('-'); writeAbs(abs(a)); }

const int N = 200010, M = 20000010;
int n, Q, m, tot;
int tag[M], rt[N], L[M], R[M], num[N];
LL sum[M];
struct Questions{ int opt, x, y, w; }q[N];

inline void pushdown(int o, int l, int r)
{
    if(!tag[o] || l == r) return;
    if(!L[o]) L[o] = ++ tot;
    if(!R[o]) R[o] = ++ tot;
    tag[L[o]] += tag[o]; tag[R[o]] += tag[o];
    sum[L[o]] += 1LL*tag[o]*(mid-l+1); sum[R[o]] += 1LL*tag[o]*(r-mid);
    tag[o] = 0;
}
inline LL query(int o, int l, int r, int x, int y)
{
    if(!o) return 0;
    if(l == x && r == y) return sum[o];
    pushdown(o, l, r);
    if(y <= mid) return query(L[o], l, mid, x, y);
    else if(x > mid) return query(R[o], mid+1, r, x, y);
    else return query(L[o], l, mid, x, mid) + query(R[o], mid+1, r, mid+1, y);
}
inline void inc(int &o, int l, int r, int x, int y)
{
    if(!o) o = ++ tot;
    if(l == x && r == y){ sum[o] += r-l+1; tag[o] ++; return; }
    pushdown(o, l, r);
    if(y <= mid) inc(L[o], l, mid, x, y);
    else if(x > mid) inc(R[o], mid+1, r, x, y);
    else inc(L[o], l, mid, x, mid), inc(R[o], mid+1, r, mid+1, y);
    sum[o] = sum[L[o]] + sum[R[o]];
}
inline int ask(int o, int l, int r, int x, int y, int k)
{
    if(l == r) return num[l];
    LL sum = query(rt[rc], 1, n, x, y);
    if(sum < k) return ask(lc, l, mid, x, y, k-sum);
    else return ask(rc, mid+1, r, x, y, k);
}
inline void insert(int o, int l, int r, int x, int y, int w)
{
    inc(rt[o], 1, n, x, y); if(l == r) return;
    if(w <= mid) insert(lc, l, mid, x, y, w);
    else insert(rc, mid+1, r, x, y, w);
}
int main()
{
    n = read(), Q = read();
    for(int i = 1; i <= Q; i ++) {
        q[i].opt = read(), q[i].x = read(), q[i].y = read(), q[i].w = read();
        if(q[i].opt == 1) num[++ m] = q[i].w;
    }
    sort(num+1, num+1+m); m = unique(num+1, num+1+m) - num-1;
    for(int i = 1; i <= Q; i ++) {
        int opt = q[i].opt, x = q[i].x, y = q[i].y, w = q[i].w;
        if(opt == 1) { w = lower_bound(num+1, num+1+m, w)-num; insert(1, 1, m, x, y, w); }
        else write(ask(1, 1, m, x, y, w)), puts("");
    }
    return 0;
}