“题解同质化严重”是一个很严重的问题

void build(int n) {
	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	memset(ss, 0, n_ * 2 * sizeof *ss);
	memset(qq, 0, n_ * 2 * sizeof *qq);
}

void pul(int i) {
	int l = i << 1, r = l | 1;

	ss[i] = ss[l] + ss[r];
	qq[i] = max(qq[l] + ss[r], qq[r]);
}

void update(int i, int x) {
	i += n_;
	qq[i] = max(ss[i] += x, 0);
	while (i > 1)
		pul(i >>= 1);
}

int query(int i) {
	int l = i, r = n_ - 1, s = 0;

	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1)
		if ((l & 1) == 1)
			s += ss[l++];
	return s;
}