hdu 4251 The Famous ICPC Team Again(划分树)

最新推荐文章于 2020-09-08 19:31:15 发布

算球？

最新推荐文章于 2020-09-08 19:31:15 发布

阅读量273

点赞数

分类专栏：划分树

本文链接：https://blog.csdn.net/gyhguoge01234/article/details/77106209

版权

划分树专栏收录该内容

2 篇文章 0 订阅

订阅专栏

套模板

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int MAXN = 100010;
int tree[20][MAXN];
int sorted[MAXN];
int toleft[20][MAXN];

void build(int l, int r, int dep)
{
    if(l == r) return;
    int mid = (l+r) >> 1;
    int same = mid-l+1;
    for(int i = l; i <= r; ++i)
        if(tree[dep][i] < sorted[mid])
            --same;
    int lpos = l;
    int rpos = mid+1;
    for(int i = l; i <= r; ++i)
    {
        if(tree[dep][i] < sorted[mid])
            tree[dep+1][lpos++] = tree[dep][i];
        else if(tree[dep][i] == sorted[mid] && same > 0)
        {
            tree[dep+1][lpos++] = tree[dep][i];
            --same;
        }
        else
            tree[dep+1][rpos++] = tree[dep][i];
        toleft[dep][i] = toleft[dep][l-1]+lpos-l;
    }
    build(l,mid,dep+1);
    build(mid+1,r,dep+1);
}

int query(int L, int R, int l, int r, int dep, int k)
{
    if(l == r) return tree[dep][l];
    int mid = (L+R) >> 1;
    int cnt = toleft[dep][r]-toleft[dep][l-1];
    if(cnt >= k)
    {
        int newl = L + toleft[dep][l-1]-toleft[dep][L-1];
        int newr = newl+cnt-1;
        return query(L,mid,newl,newr,dep+1,k);
    }
    else
    {
        int newr = r + toleft[dep][R]-toleft[dep][r];
        int newl = newr - (r-l-cnt);
        return query(mid+1,R,newl,newr,dep+1,k-cnt);
    }
}

int main()
{
    int n,m;
    int time = 0;
    while(scanf("%d",&n) != EOF)
    {
        memset(tree,0,sizeof(tree));
        for(int i = 1; i <= n; ++i)
        {
            scanf("%d",&tree[0][i]);
            sorted[i] = tree[0][i];
        }
        sort(sorted+1,sorted+1+n);
        build(1,n,0);
        scanf("%d",&m);
        int s,t,k;
        printf("Case %d:\n",++time);
        while(m--)
        {
            scanf("%d %d",&s,&t);
            k = (s+t)/2-s+1;
            printf("%d\n",query(1,n,s,t,0,k));
        }
    }
    return 0;
}