2019 HDU 多校赛第三场 HDU 6609 Find the answer(树状数组+二分答案 查询前k小)

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 2e5+10;
ll sum[maxn],cnt[maxn];
int a[maxn],b[maxn];
ll mp[maxn];
int lowbit(int k){
	return (k&(-k));
}
void insert(int k,ll x,ll val){
	while(k<maxn){
		sum[k]+=val;//sum 表示 k位置数的和 
		cnt[k]+=x;
		k+=lowbit(k);
	}
}
ll query(int k){
	ll ssum = 0;
	while(k>0){
		ssum+=sum[k];
		k-=lowbit(k); 
	}
	return ssum;
}
ll querycnt(int k){
	ll ccnt=0;
	while(k>0){
		ccnt+=cnt[k];
		k-=lowbit(k);
	}
	return ccnt;
}
bool check(int k,ll m){
	ll now = query(k);
	if(now<=m)return true;
	else return false;
} 
int main()
{
	int q;
	scanf("%d",&q);
	while(q--){
		int n;ll m;
		scanf("%d %lld",&n,&m);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			cnt[i] = 0;	sum[i] = 0;
			b[i] = a[i];
		}
		sort(b+1,b+1+n);
		int sz = unique(b+1,b+1+n) - (b+1);
		for(int i=1;i<=n;i++){
			int tp = lower_bound(b+1,b+1+sz,a[i]) - b;
			mp[tp] = a[i];
			a[i] = tp;
		}
		printf("0 ");

		for(int i=2;i<=n;i++){
			insert(a[i-1],1,mp[a[i-1]]);
			int l = 0, r = sz,mid;
			int f;
			while(l<=r){
				mid = (l+r)>>1;
				if(check(mid,m-mp[a[i]])){
					f = mid;
					l = mid+1;	
				}else r = mid-1;
			}
			mid = f;
			ll ans = querycnt(mid);
			ll tsum = query(mid);
			if(mid<sz)
			{
				ll ex = min((m-mp[a[i]]-tsum)/b[mid+1],querycnt(mid+1)-querycnt(mid));
				ans+=ex;	
			}
			printf("%lld ",i-ans-1);
		}
		printf("\n");
	}
	return 0;	
}