思路:
每个点离散后,建立一棵权值线段树,维护区间的和以及区间的数字的数量。每次砍掉前面最大的几个使得剩下的数字之和<=m-x,x为当前要加进来的数字。反过来就是从小找最多的数字,使得和<=m-x。每次从权值线段树的左边找过来就好了。
参考代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(x,a,b) for(register int x=a;x<=b;x++)
#define _dbg(x) cout<<x<<'\n';
#define T(x) int T;read(T);rep(x,1,T)
const int N=2e5+5;
ll a[N],ls[N];
int ans[N],ind[N];
template <typename _Tp> inline _Tp read(_Tp&x){
char c11=getchar(),ob=0;x=0;
while(c11^'-'&&!isdigit(c11))c11=getchar();if(c11=='-')c11=getchar(),ob=1;
while(isdigit(c11))x=x*10+c11-'0',c11=getchar();if(ob)x=-x;return x;
}
#define val first
#define num second
pll tree[N<<2];
#define lson rt<<1
#define rson rt<<1|1
void build(int rt,int l,int r){
if(l==r){
tree[rt].num=0;
tree[rt].val=0;
return ;
}
int mid=(l+r)>>1;
build(lson,l,mid);
build(rson,mid+1,r);
tree[rt].num=tree[rt].val=0;
}
void update(int rt,int l,int r,int x){
if(l==r){
tree[rt].num++;
tree[rt].val+=ls[x];
return ;
}
int mid=(l+r)>>1;
if(x<=mid)update(lson,l,mid,x);
else update(rson,mid+1,r,x);
tree[rt].num=tree[lson].num+tree[rson].num;
tree[rt].val=tree[lson].val+tree[rson].val;
}
ll k;//前面小
ll query(int rt,int l,int r,int x,ll v){
if(l==r){
ll tp=min(v/ls[l],tree[rt].num);
k+=tp;
return tp*ls[l];
}
else if(tree[rt].val<=v){
k+=tree[rt].num;
return tree[rt].val;
}
int mid=(l+r)>>1;
ll ret=query(lson,l,mid,x,v);
if(ret==tree[lson].val)ret+=query(rson,mid+1,r,x,v-ret);//左子树没找满就没必要去右边找了
return ret;
}
int main(){
T(ca){
int n;
ll m;
read(n),read(m);
rep(i,1,n){
read(a[i]);
ls[i]=a[i];
}
sort(ls+1,ls+1+n);//离散
int sz=unique(ls+1,ls+1+n)-ls-1;
rep(i,1,n){
ind[i]=lower_bound(ls+1,ls+1+sz,a[i])-ls;
}
build(1,1,sz);
rep(i,1,n){
k=0;
query(1,1,sz,ind[i],m-a[i]);
printf("%d ",i-1-(int)k);
update(1,1,sz,ind[i]);
}
printf("\n");
}
return 0;
}