HDU6609 Find the answer (权值线段树)

题目：http://acm.hdu.edu.cn/showproblem.php?pid=6609

题意：对第i个数a[i]，删去最少的数，使它的前缀和不超过m，询问最少删数个数。

思路：题意转换成在ｉ之前选尽量多的数，使所有数的和不超过 m-a[i] 。权值线段树维护数字个数和区间和即可。

#include <bits/stdc++.h>
#define ls rt<<1
#define rs rt<<1|1
#define LL long long
using namespace std;
const int maxn = 2e5+5;

vector<LL>vec;
int t, n, m, num[maxn<<2]; LL sum[maxn<<2], a[maxn];
int getid(LL x){return lower_bound(vec.begin(), vec.end(), x)-vec.begin()+1;}
void update(int rt, int l, int r, int pos){
    if(l == r) {num[rt] ++; sum[rt] += vec[pos-1]; return ;}
    int mid = l+r >> 1;
    if(pos <= mid) update(ls, l, mid, pos);
    else update(rs, mid+1, r, pos);
    num[rt] = num[ls] + num[rs];
    sum[rt] = sum[ls] + sum[rs];
}
int query(int rt, int l, int r, LL val){
    if(l == r) {return val/vec[l-1];}
    int mid = l+r >> 1;
    if(val <= sum[ls]) return query(ls, l, mid, val);
    else return num[ls] + query(rs, mid+1, r, val-sum[ls]);
}
int main(){
    cin >> t;
    while(t--){
        vec.clear(); memset(num, 0, sizeof num); memset(sum, 0, sizeof sum);
        cin >> n >> m;
        for(int i=1; i<=n; i++) {cin >> a[i]; vec.push_back(a[i]);}
        sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());
        LL res = 0; int sz = vec.size();
        for(int i=1; i<=n; i++){
            res += a[i];
            if(res <= m) printf("0 ");
            else printf("%d ", i-query(1, 1, sz, m-a[i])-1);
            update(1, 1, sz, getid(a[i]));
        }puts("");
    }
}