hdu 4417

最新推荐文章于 2020-01-14 11:23:49 发布

liurui39660

最新推荐文章于 2020-01-14 11:23:49 发布

阅读量266

点赞数

分类专栏：划分树 hdu

本文链接：https://blog.csdn.net/liurui39660/article/details/52562267

版权

hdu 同时被 2 个专栏收录

96 篇文章 0 订阅

订阅专栏

划分树

2 篇文章 0 订阅

订阅专栏

讨论

划分树，二分，以往是直接问区间第k个数是几，这回反过来，给数问是第几个，二分即可，划分树的构造是线性对数级，每次查询是对数级，这样综合复杂度就是构造的 $O(NlogN)$ 和查询的 $O(Q(logN)^2)$

题解状态

343MS，15424K，1988 B，C++

题解代码

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 100005
#define memset0(a) memset(a,0,sizeof(a))

int N, Q;//砖块总数 查询次数
int tree[17][MAXN], sorted[MAXN], toleft[17][MAXN];//划分树三数组 树本体 排序后的数列 每层被划分到左子树的个数
void build(int l, int r, int d)//构造
{
    if (l == r)
        return;
    int mid = (l + r) / 2, same = mid - l + 1;
    for (int p = l; p <= r; p++)
        same -= tree[d][p] < sorted[mid];
    int ltop = l, rtop = mid + 1;
    for (int p = l; p <= r; p++) {
        bool f = 0;
        if (tree[d][p] < sorted[mid])
            tree[d + 1][ltop++] = tree[d][p];
        else if (tree[d][p] == sorted[mid] && same) {
            tree[d + 1][ltop++] = tree[d][p];
            same--;
        }
        else {
            f = 1;
            tree[d + 1][rtop++] = tree[d][p];
        }
        toleft[d][p] = toleft[d][p - 1] + 1 - f;
    }
    build(l, mid, d + 1);
    build(mid + 1, r, d + 1);
}
int query(int L, int R, int l, int r, int d, int k)//查询
{
    if (l == r)
        return tree[d][l];
    int lx = toleft[d][l - 1] - toleft[d][L - 1], ly = toleft[d][r] - toleft[d][L - 1];
    int rx = l - L - lx, ry = r - L - ly;
    int mid = (L + R) / 2, cnt = ly - lx;
    if (k <= cnt)
        return query(L, mid, L + lx, L + ly - 1, d + 1, k);
    else
        return query(mid + 1, R, mid + rx + 1, mid + ry + 1, d + 1, k - cnt);
}
void fun()
{
    for (int p = 1; p <= N; p++) {
        scanf("%d", &tree[0][p]);//input
        sorted[p] = tree[0][p];
    }
    sort(sorted + 1, sorted + N + 1);
    build(1, N, 0);
    for (int p = 0; p < Q; p++) {
        int l, r, h;
        scanf("%d%d%d", &l, &r, &h);//input
        int low = 0, high = r - l + 2, mid, ans = 0;
        while (high > low + 1) {
            mid = (low + high) / 2;
            if (query(1, N, l + 1, r + 1, 0, mid) <= h) {
                ans = max(ans, mid);//记录下答案
                low = mid;
            }
            else
                high = mid;
        }
        printf("%d\n", ans);//output
    }
}
int main(void)
{
    //freopen("vs_cin.txt", "r", stdin);
    //freopen("vs_cout.txt","w",stdout);

    int times;
    scanf("%d", &times);//input
    for (int p = 1; p <= times; p++) {
        printf("Case %d:\n", p);//output
        scanf("%d%d", &N, &Q);//input
        fun();
    }
}