HDU - 3473 Minimum Sum 划分树

题目链接：https://cn.vjudge.net/problem/HDU-3473

题意：find a number x to make as small as possible!

题解：本来想三分x感觉会T，想了一下，当然x就是[l, r] 所有数的中位数了，至于为什么，可以用假设法，假设x为中位数，然后让x减小或增大想一下，那么假设前k大的和为suml，那么结果就是sum - suml - suml，奇数的时候处理一下中位数即可，剩下的就是划分树求结果了，另加一个sum数组，表示左子树所有数的和

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int a[N], b[N];
int tree[22][N];
int num[22][N]; //进入左孩子个数
ll sum[22][N];
ll su_[N];
int n, m;
void build(int l, int r, int cur) {
	if(l == r) return;
	int mid = (l + r) >> 1;
	int lson = mid - l + 1;
	for(int i = l; i <= r; i++)
		if(tree[cur][i] < b[mid])
			lson--;
	int ln = l, rn = mid + 1;
	for(int i = l; i <= r; i++) {
		if(i == l) num[cur][i] = 0, sum[cur][i] = 0;
		else num[cur][i] = num[cur][i - 1], sum[cur][i] = sum[cur][i - 1];
		if(tree[cur][i] < b[mid] || (tree[cur][i] == b[mid] && lson > 0)) {
			tree[cur + 1][ln++] = tree[cur][i];
			num[cur][i]++;
			sum[cur][i] += tree[cur][i];
			if(tree[cur][i] == b[mid]) lson--;
		} else {
			tree[cur + 1][rn++] = tree[cur][i];
		}
	}
	build(l, mid, cur + 1);
	build(mid + 1, r, cur + 1);
}
ll res;
int cntval;
void query(int pl, int pr, int l, int r, int cur, int k) {
	if(l == r) {
		res += tree[cur][l];
		cntval = tree[cur][l];
		return;
	}
	int lson;
	int mid = (l + r) >> 1;
	ll tmp;
	if(pl == l) lson = 0, tmp = 0;
	else lson = num[cur][pl - 1], tmp = sum[cur][pl - 1];
	int cnt = num[cur][pr] - lson;
	if(cnt >= k) {
		query(l + lson, l + num[cur][pr] - 1, l, mid, cur + 1, k);
	} else {
		int posr = mid + 1 + (pl - l - lson); // 右子树中第一个位置 
		res += sum[cur][pr] - tmp;
		query(posr, posr + (pr - pl + 1 - cnt) - 1, mid + 1, r, cur + 1, k - cnt); 
	}
}
int main() {
	int T;
	int nn = 1;
	int l, r, k;
	int mid;
	scanf("%d", &T);
	while(T--) {
		scanf("%d", &n);
		for(int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			b[i] = a[i];
			su_[i] = su_[i - 1] + a[i];
			tree[0][i] = a[i];
		}
		scanf("%d", &m);
		sort(b + 1, b + 1 + n);
		build(1, n, 0);
		printf("Case #%d:\n", nn++);
		while(m--) {
			scanf("%d %d", &l, &r);
			l++; r++;
			res = 0;
			mid = (r - l + 1 + 1) / 2;
			query(l, r, 1, n, 0, mid);
			if((r - l + 1) & 1) {
				res = (su_[r] - su_[l - 1] - res - (res - cntval));
			} else {
				res = su_[r] - su_[l - 1] - res - res;
			}
			
			printf("%lld\n", res);
		}
		puts("");
	}
	return 0;
}