zoukankan      html  css  js  c++  java
  • poj2104 K-th Number(划分树)

    K-th Number
    Time Limit: 20000MS   Memory Limit: 65536K
    Total Submissions: 66068   Accepted: 23273
    Case Time Limit: 2000MS

    Description

    You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment.
    That is, given an array a[1...n] of different integer numbers, your program must answer a series of questions Q(i, j, k) in the form: "What would be the k-th number in a[i...j] segment, if this segment was sorted?"
    For example, consider the array a = (1, 5, 2, 6, 3, 7, 4). Let the question be Q(2, 5, 3). The segment a[2...5] is (5, 2, 6, 3). If we sort this segment, we get (2, 3, 5, 6), the third number is 5, and therefore the answer to the question is 5.

    Input

    The first line of the input file contains n --- the size of the array, and m --- the number of questions to answer (1 <= n <= 100 000, 1 <= m <= 5 000).
    The second line contains n different integer numbers not exceeding 109 by their absolute values --- the array for which the answers should be given.
    The following m lines contain question descriptions, each description consists of three numbers: i, j, and k (1 <= i <= j <= n, 1 <= k <= j - i + 1) and represents the question Q(i, j, k).

    Output

    For each question output the answer to it --- the k-th number in sorted a[i...j] segment.

    Sample Input

    7 3
    1 5 2 6 3 7 4
    2 5 3
    4 4 1
    1 7 3

    Sample Output

    5
    6
    3

    Hint

    This problem has huge input,so please use c-style input(scanf,printf),or you may got time limit exceed.
    求区间第k小,划分树模板题
     
    //划分树
    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    #include <cstring>
    using namespace std;
    #define maxn 100006
    int tree[20][maxn];
    int sorted[maxn];
    int toleft[20][maxn];
    int n,m;
    void build(int l,int r,int dep){
        if(l==r) return ;
        int mid=l+r>>1;
        int ans=mid-l+1;
        for(int i=l;i<=r;i++)
            if(tree[dep][i]<sorted[mid]) ans--;
        int lpos=l,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] && ans) tree[dep+1][lpos++]=tree[dep][i],ans--;
            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 ans=toleft[dep][r]-toleft[dep][l-1];
        if(ans>=k){
            int newl=L+toleft[dep][l-1]-toleft[dep][L-1];
            int newr=newl+ans-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-ans);
            return query(mid+1,R,newl,newr,dep+1,k-ans);
        }
    }
    int main(){
        scanf("%d%d",&n,&m);
        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);
        while(m--){
            int x,y,k;
            scanf("%d%d%d",&x,&y,&k);
            printf("%d
    ",query(1,n,x,y,0,k));
        }
        return 0;
    }
  • 相关阅读:
    1.NopCommerce下载与安装
    DLT(Direct Linear Transform)算法
    向量叉乘与叉乘矩阵
    最小二乘与最大似然估计之间的关系
    最小二乘法
    Levenberg-Marquardt迭代(LM算法)-改进Guass-Newton法
    Newton法(牛顿法 Newton Method)
    自己所有博客汇总
    Unity 预制体烘焙光影丢失,Unity2018 预制嵌套
    XmlException: Text node canot appear in this state
  • 原文地址:https://www.cnblogs.com/shinianhuanniyijuhaojiubujian/p/9158777.html
Copyright © 2011-2022 走看看