HDU 3473 Minimum Sum 划分树

题目：http://acm.hdu.edu.cn/showproblem.php?pid=3473

题意：给定一个数组，给定一些区间，找到一个数，使区间内的每个数减去这个数的绝对值的和最小

思路：找到的这个数肯定是区间的中位数，用划分树易求，但是差值的绝对值求和就比较坑了，直接T了。。。设mid是中位数，那么最后的结果是xmid - x1 + xmid - x2 + ...+ xn-1 - xmid + xn - xmid，化简合并得xmid * (leftnum - rightnum) + rightsum - leftsum，leftnum为划分过程进入左子树的个数，leftsum为进入左子树的数之和

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

const int N = 100010;
typedef long long ll;
struct node
{
    int l, r;
} s[N*4];
int n, m;
int arr[N], arrs[N], cut[20][N], seg[20][N];
ll lsum[20][N], sum[N], leftnum, leftsum;
void build(int d, int l, int r, int k)
{
    s[k].l = l, s[k].r = r;
    if(l == r) return;
    int mid = (l + r) >> 1, cnt = mid - l + 1, lb = l, rb = mid + 1;
    for(int i = l; i <= mid; i++)
        if(arrs[i] < arrs[mid]) cnt--;
    for(int i = l; i <= r; i++)
    {
        if(i == l) cut[d][i] = 0;
        else cut[d][i] = cut[d][i-1];
        lsum[d][i] = lsum[d][i-1]; /*每次计算出左子树的和*/
        if(seg[d][i] == arrs[mid])
        {
            if(cnt)
                cnt--, cut[d][i]++, seg[d+1][lb++] = seg[d][i], lsum[d][i] += seg[d][i];
            else seg[d+1][rb++] = seg[d][i];
        }
        else if(seg[d][i] < arrs[mid])
            cut[d][i]++, seg[d+1][lb++] = seg[d][i], lsum[d][i] += seg[d][i];
        else seg[d+1][rb++] = seg[d][i];
    }
    build(d + 1, l, mid, k << 1);
    build(d + 1, mid + 1, r, k << 1|1);
}

int query(int d, int l, int r, int x, int k)
{
    if(s[k].l == s[k].r) return seg[d][s[k].l];
    int mid = (s[k].l + s[k].r) >> 1, ls, lss;
    if(l == s[k].l) ls = 0, lss = cut[d][r];
    else ls = cut[d][l-1], lss = cut[d][r] - ls;
    if(x <= lss) return query(d + 1, s[k].l + ls, s[k].l + ls + lss - 1, x, k << 1);
    else
    {
        leftnum += lss; /*进入右子树时，左子树中的数小于中位数之前，所以加上*/
        leftsum += lsum[d][r] - lsum[d][l-1]; /*同理*/
        return query(d + 1, mid + 1 + l - s[k].l - ls, mid + 1 + r - s[k].l - ls - lss, x - lss, k << 1|1);
    }
}
int main()
{
    int t, a, b, x = 0;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        sum[0] = 0;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", arr + i);
            sum[i] = sum[i-1] + arr[i];
            seg[0][i] = arrs[i] = arr[i];
        }
        sort(arrs + 1, arrs + 1 + n);
        build(0, 1, n, 1);

        scanf("%d", &m);
        printf("Case #%d:\n", ++x);
        while(m--)
        {
            scanf("%d%d", &a, &b);
            a++, b++;
            leftnum = leftsum = 0;
            ll tmp = query(0, a, b, (b - a) / 2 + 1, 1);
            printf("%I64d\n", tmp * (leftnum - (b - a + 1 - leftnum)) + sum[b] - sum[a-1] - 2 * leftsum);
        }
        printf("\n");
    }

    return 0;
}