2019杭电多校 HDU - 6609 Find the answer 线段树

题目链接：https://vjudge.net/problem/HDU-6609

题意：前 i 个数至少去掉多少数，满足和小于等于m

题解：先离散化，线段树区间 [l, r]，维护前 i 个的，权值在[l, r] 内的数量和权值和，每次查询m-a[i] 的最大数量即可

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
typedef long long ll;
struct node {
    int l, r;
    ll sum;
    int num;
}tree[N << 2];
int n, m;
int a[N], b[N], len;
void build(int l, int r, int cur) {
    tree[cur].l = l;
    tree[cur].r = r;
    tree[cur].sum = 0;
    tree[cur].num = 0;
    if(l == r) return;
    int mid = (r + l) >> 1;
    build(l, mid, cur << 1);
    build(mid + 1, r ,cur << 1 | 1);
}
void pushup(int cur) {
    tree[cur].sum = tree[cur << 1].sum + tree[cur << 1 | 1].sum;
    tree[cur].num = tree[cur << 1].num + tree[cur << 1 | 1].num;
}
void update(int pos, int cur) {
    if(tree[cur].l == tree[cur].r) {
        tree[cur].sum += b[tree[cur].l];
        tree[cur].num ++;
        return;
    }
    if(pos <= tree[cur << 1].r) update(pos, cur << 1);
    else update(pos, cur << 1 | 1);
    pushup(cur);
}
int query(int cur , int val) {
    if(tree[cur].sum <= val) {
        return tree[cur].num;
    }
    if(tree[cur].l == tree[cur].r) {
        return val / b[tree[cur].l];
    }
    
    if(tree[cur << 1].sum >= val) return query(cur << 1, val);
    else return tree[cur << 1].num + query(cur << 1 | 1, val - tree[cur << 1].sum);
}
int main() {
    int T, pos;
    scanf("%d", &T);
    while(T--) {
        scanf("%d %d", &n, &m);
        for(int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            b[i] = a[i];
        }
        sort(b + 1, b + 1 + n);
        len = unique(b + 1, b + 1 + n) - (b + 1);
        build(1, len, 1);
        for(int i = 1; i <= n; i++) {
            if(i == 1) printf("0 ");
            else {
                printf("%d ", i - 1 - query(1, m - a[i]));
            }
            pos = lower_bound(b + 1, b + 1 + len, a[i]) - b;
            update(pos, 1);
        }
        printf("\n");
    }
    return 0;
}