2019牛客暑期多校训练营（第七场） E Find the median （线段树+离散化区间）

题目链接：https://ac.nowcoder.com/acm/contest/887/E 

 题意：每次插入区间[Li, Ri]之间的数，查询中位数

多次询问，所以需要线段树维护，把区间离散化一下，让线段树每个节点l, r维护 离散化之后的区间数组的下标，sum维护区间内的数字的个数，lazy标记数组，len区间长度。离散化之后，就是平常的线段树维护了

 

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 4e5 + 10;
ll x[maxn], y[maxn];
struct Tree{
    int l, r;
    ll sum, len, lazy;
}tree[maxn << 3];
int b[maxn << 1];
inline void pushup(int cur){
    tree[cur].sum = tree[cur << 1].sum + tree[cur << 1 | 1].sum;
}
inline void build(int l, int r, int cur) {
    tree[cur].l = l;
    tree[cur].r = r;
    tree[cur].sum = tree[cur].lazy = 0;
    if(l == r) {
        tree[cur].len = b[l + 1] - b[l];

        return;
    }
    int mid = l + r >> 1;
    build(l, mid, cur << 1);
    build(mid + 1, r, cur << 1 | 1);
    tree[cur].len = tree[cur << 1].len + tree[cur << 1 | 1].len;
}
inline void pushdown(int cur){
    if(tree[cur].lazy != 0){
        tree[cur << 1].lazy += tree[cur].lazy;
        tree[cur << 1].sum  += tree[cur].lazy * tree[cur << 1].len;
        tree[cur << 1 | 1].lazy += tree[cur].lazy;
        tree[cur << 1 | 1].sum  += tree[cur].lazy * tree[cur << 1 | 1].len;
        tree[cur].lazy = 0;
    }
}
inline void update(int cur, int l, int r) {
    if(l <= tree[cur].l && tree[cur].r <= r) {
        tree[cur].sum += tree[cur].len ;
        tree[cur].lazy++;
        return ;
    }
    pushdown(cur);
    int mid = tree[cur].l + tree[cur].r >> 1;
    if(l <= mid) update(cur << 1, l, r);
    if(mid < r) update(cur << 1 | 1, l, r);
    pushup(cur);
}

inline int query(int cur, ll pos) {
    if(tree[cur].l == tree[cur].r) {
        ll tmp = tree[cur].sum / tree[cur].len;
        return b[tree[cur].l] + (pos - 1) / tmp;
    }
    pushdown(cur);
    if(pos <= tree[cur << 1].sum) return query(cur << 1, pos);
    else return query(cur << 1 | 1, pos - tree[cur << 1].sum);
}

int main()
{
    int n, a1, a2, b1, b2, c1, c2, m1, m2;
    scanf("%d", &n);
    scanf("%lld %lld %d %d %d %d", &x[1], &x[2], &a1, &b1, &c1, &m1);
    scanf("%lld %lld %d %d %d %d", &y[1], &y[2], &a2, &b2, &c2, &m2);
    for(int i = 3; i <= n; i++) {
        x[i] = (1ll * a1 * x[i - 1] + 1ll * b1 * x[i - 2] + c1) % m1;
        y[i] = (1ll * a2 * y[i - 1] + 1ll * b2 * y[i - 2] + c2) % m2;
    }
    int len = 0;
    for(int i = 1; i <= n; i++) {
        ll l, r;
        l = min(x[i], y[i]) + 1;
        r = max(x[i], y[i]) + 1;
        x[i] = l;
        y[i] = r;
        b[++len] = l;
        b[++len] = r + 1;
    }
    sort(b + 1, b + len + 1);
    len = unique(b + 1, b + len + 1) - (b + 1);
    for(int i = 1; i <= n; i++) {
        x[i] = lower_bound(b + 1, b + len + 1, x[i]) - b;
        y[i] = lower_bound(b + 1, b + len + 1, y[i] + 1) - b;
    }
    build(1, len - 1, 1);
    ll sum = 0;
    for(int i = 1; i <= n; i++) {
        update(1, x[i], y[i] - 1);
        sum += b[y[i]] - b[x[i]]; 
        printf("%d\n", query(1, (sum + 1) / 2));
    }
    return 0;
}