hdu 3473 划分树求范围内小于中位数的和与大于中位数的和

题意：

给一个数组，然后给 l 和 r ，求在l，r范围内上面这个式子的最小值。

解析：

用划分树来求。

当其长度为偶数的时候，要把多加的减掉。

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <climits>
#include <cassert>
#define LL long long
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1

using namespace std;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);

int tree[20][maxn];     //表示每层每个位置的值
int sorted[maxn];       //排完序的数
int toleft[20][maxn];   //toleft[p][i]表示第p层从1到i有多少个数在左边
LL sum[20][maxn];

void build(int lo, int hi, int dep)
{
    if (lo == hi)
    {
        sum[dep][lo] = tree[dep][lo];
        return;
    }
    int mi = (lo + hi) >> 1;
    int same = mi - lo + 1;          //等于中位数的数字个数
    for (int i = lo; i <= hi; i++)
    {
        if (tree[dep][i] < sorted[mi])
        {
            same--;
        }
        sum[dep][i] = tree[dep][i];
        if (lo < i)
        {
            sum[dep][i] += sum[dep][i - 1];
        }
    }

    int loPos = lo;
    int hiPos = mi + 1;
    for (int i = lo; i <= hi; i++)
    {
        if (tree[dep][i] < sorted[mi])//比中位数小
        {
            tree[dep + 1][loPos++] = tree[dep][i];
        }
        else if (tree[dep][i] == sorted[mi] && 0 < same)
        {
            tree[dep + 1][loPos++] = tree[dep][i];
            same--;
        }
        else                          //比中位数大
        {
            tree[dep + 1][hiPos++] = tree[dep][i];
        }
        toleft[dep][i] = toleft[dep][lo - 1] + loPos - lo; // - l  不是减一
    }
    build(lo, mi, dep + 1);
    build(mi + 1, hi, dep + 1);
}

LL ans;
//查询区间第k大数
int query(int L, int H, int lo, int hi, int dep, int k)
{
    if (lo == hi)
        return tree[dep][lo];
    int mi = (L + H) >> 1;
    int cnt = toleft[dep][hi] - toleft[dep][lo - 1];

    int ss = toleft[dep][lo - 1] - toleft[dep][L - 1];
    int ee = lo - L - ss;
    int s = toleft[dep][hi] - toleft[dep][lo - 1];
    int e = hi - lo + 1 - s;

    if (k <= cnt)
    {
        if (0 < e)
        {
            if (0 < ee)
            {
                ans += sum[dep + 1][mi + e + ee] - sum[dep + 1][mi + ee];
            }
            else
            {
                ans += sum[dep + 1][mi + e];
            }
        }

        int nextl = L + toleft[dep][lo - 1] - toleft[dep][L - 1];
        int nexth = nextl + cnt - 1;
        return query(L, mi, nextl, nexth, dep + 1, k);
    }
    else
    {
        if (0 < s)
        {
            if (0 < ss)
            {
                ans -= sum[dep + 1][L + ss + s - 1] - sum[dep + 1][L + ss - 1];
            }
            else
            {
                ans -= sum[dep + 1][L + s - 1];
            }
        }

        int nexth = hi + toleft[dep][H] - toleft[dep][hi];
        int nextl = nexth - (hi - lo - cnt);
        return query(mi + 1, H, nextl, nexth, dep + 1, k - cnt);
    }
}

int main()
{
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif // LOCAL
    int n, m;
    int ca = 1;
    int ncase;
    scanf("%d", &ncase);
    while (ncase--)
    {
        scanf("%d", &n);
        memset(tree, 0, sizeof(tree));
        memset(toleft, 0, sizeof(toleft));
        for (int i = 1; i <= n; i++)//start from 1
        {
            scanf("%d", &tree[0][i]);
            sorted[i] = tree[0][i];
        }
        sort(sorted + 1, sorted + n + 1);
        build(1, n, 0);

        scanf("%d", &m);
        printf("Case #%d:\n", ca++);
        while (m--)
        {
            int fr, to;
            scanf("%d%d", &fr, &to);
            fr++, to++;
            ans = 0;
            int midNum = query(1, n, fr, to, 0, ((to - fr) >> 1) + 1);
            if (((to - fr + 1) % 2) == 0)
            {
                ans -= midNum;
            }
            printf("%I64d\n", ans);
        }
//        if (ncase)
        printf("\n");
    }
    return 0;
}