Find the answer-hduoj 6609-2019暑期杭电多校训练营第3场（线段树-前缀和）

Find the answer（有注释）-hduoj 6609-2019暑期杭电多校训练营第3场（线段树-前缀和）

judge：hduoj 6609
source：2019 Multi-University Training Contest 3
Time Limit: 4000/4000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)

Problem Description

Given a sequence of $n$ integers called $W$ and an integer $m$. For each $i(1<=i<=n)$, you can choose some elements $W_k(1<=k<i)$, and change them to zero to make ${\sum }_{j=1}^i{W}_j<=m$. So what’s the minimum number of chosen elements to meet the requirements above?.

Input

The first line contains an integer $Q$ — the number of test cases.
For each test case:
The first line contains two integers $n$ and $m$ — $n$ represents the number of elemens in sequence $W$ and $m$ is as described above.
The second line contains n integers, which means the sequence $W$.

$1<=Q<=15$
$1<=n<=2\ast 10^5$
$1<=m<=10^9$
For each $i,1<=W_i<=m$

Output

For each test case, you should output n integers in one line: $i-th$ integer means the minimum number of chosen elements $W_k(1<=k<i)$, and change them to zero to make ${\sum }_{j=1}^i{W}_j<=m$.

Sample Input

2
7 15
1 2 3 4 5 6 7
5 100
80 40 40 40 60

Sample Output

0 0 0 0 0 2 3
0 1 1 2 3

题意

给你一个序列，让你删去前 $i-1$ 个数中的尽可能少的若干个数以达到前 $i$ 个数的和小于等于$m$。

对于第$i$个位置，怎样选择数字才会使满足条件情况下选择数字数目最少呢？很容易想到，需要选择前$i-1$个数中较大的数字，使其变为$0$。

基于这个思想，如果我们对于每个位置i都暴力去找最大的前几个数，显然会$TLE$!

可以注意到，题目可以转化为前 $i-1$ 个数中最多选出多少个数字和 $W[i]$ 相加使得其和小于等于 $m$（很容易想到，选择较小的数才会使选的数最多）。转化之后就很容易想到用线段树来维护了。

我们对给定数组进行离散化，对于离散化之后的数组建立一颗线段树，线段树上的每个节点记录区间之和以及区间内数字个数。 时间复杂度：$N\ast log(N)$

万万没想到这题可以用线段树做，原来自己对线段树一无所知……

代码

#include <bits/stdc++.h>
#define ls node<<1
#define rs node<<1|1
#define _for(i, a) for(int i = 0; i < (a); i++)
#define _rep(i, a, b) for(int i = (a); i <= (b); i++)
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
typedef long long ll;
using namespace std;
int n, m;
int a[maxn];
ll sum[maxn << 2];
int num[maxn << 2];
int b[maxn];
ll val[maxn];
map<ll, int> mp;
void push(int node) {
	sum[node] = sum[ls] + sum[rs];
	num[node] = num[ls] + num[rs];
}
void build(int node, int l, int r) {
	if (l == r) {
		sum[node] = 0;
		num[node] = 0;
		return;
	}
	int mid = (l + r) >> 1;
	build(ls, l, mid);
	build(rs, mid + 1, r);
	push(node);
}
void upd(int node, int l, int r, int k, ll val) {
	if (l == r) {
		sum[node] = val;
		num[node] = 1;
		return;
	}
	int mid = (l + r) >> 1;
	if (k <= mid) upd(ls, l, mid, k, val);
	else upd(rs, mid + 1, r, k, val);
	push(node);
}
int query(int node, int l, int r, ll val) {
	if (l == r) {
		return num[node];
	}
	int mid = (l + r) >> 1;
	if (sum[rs] == val) return num[rs];
	else if (sum[rs] < val) {
		return num[rs] + query(ls, l, mid, val - sum[rs]);
	}
	else {
		return query(rs, mid + 1, r, val);
	}
}
int main() {
	int T;
	scanf("%d", &T);
	_for(q, T) {
		memset(val, 0, sizeof(val));
		mp.clear();
		scanf("%d%d", &n, &m);
		build(1, 1, n);
		_rep(i, 1, n) {
			scanf("%d", a + i);
			b[i] = a[i];
			val[i] = val[i - 1] + a[i];
		}
		sort(b + 1, b + 1 + n);
		_rep(i, 1, n) {
			if (!mp.count(b[i])) mp[b[i]] = i;
		}
		_rep(i, 1, n) {
			if (val[i] <= m) cout << "0 ";
			else {
				cout << query(1, 1, n, val[i] - m) << " ";
			}
			upd(1, 1, n, mp[a[i]], a[i]);
			mp[a[i]]++;
		}
		cout << "\n";
	}
	return 0;
}