poj 2104 区间第K小 主席树入门题
来源:互联网 发布:linux如何安装xz 编辑:程序博客网 时间:2024/05/22 05:05
K-th Number
Time Limit: 20000MS Memory Limit: 65536KTotal Submissions: 40933 Accepted: 13377Case 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.
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).
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 31 5 2 6 3 7 42 5 34 4 11 7 3
Sample Output
563
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int maxn=100010;const int M=maxn*30;int n,q,m,tot;int a[maxn],t[maxn];int T[M],lson[M],rson[M],c[M];void init_hash()//离散化{ for(int i=1;i<=n;i++) t[i]=a[i]; sort(t+1,t+1+n); m=unique(t+1,t+1+n)-t-1;}int hash(int x){ return lower_bound(t+1,t+1+m,x) - t;}int build(int l,int r)//建树{ int root=tot++; c[root]=0; if(l!=r) { int mid=(l+r)>>1; lson[root]=build(l,mid); rson[root]=build(mid+1,r); } return root;}int update(int root,int pos,int val){ int newroot=tot++,tmp=newroot; c[newroot]=c[root]+val; int l=1,r=m; while(l<r) { int mid=(l+r)>>1; if(pos<=mid) { lson[newroot]=tot++;rson[newroot]=rson[root]; newroot=lson[newroot];root=lson[root]; r=mid; } else { rson[newroot]=tot++;lson[newroot]=lson[root]; newroot=rson[newroot];root=rson[root]; l=mid+1; } c[newroot]=c[root]+val; } return tmp;}int query(int left_root,int right_root,int k){ int l=1,r=m; while(l<r) { int mid=(l+r)>>1; if(c[lson[left_root]]-c[lson[right_root]] >= k)//区间第K小 { r=mid; left_root=lson[left_root]; right_root=lson[right_root]; } else { l=mid+1; k-=c[lson[left_root]]-c[lson[right_root]]; left_root=rson[left_root]; right_root=rson[right_root]; } } return l;}int main(){ while(scanf("%d%d",&n,&q)==2) { tot=0; for(int i=1;i<=n;i++) scanf("%d",&a[i]); init_hash(); T[n+1]=build(1,m); for(int i=n;i;i--) { int pos=hash(a[i]); T[i]=update(T[i+1],pos,1); } while(q--) { int l,r,k; scanf("%d%d%d",&l,&r,&k); printf("%d\n",t[query(T[l],T[r+1],k)]); } }}
0 0
- poj 2104 区间第K小 主席树入门题
- 【主席树入门 && 区间内第k小的数】POJ
- POJ 2104 & HDU 2665 & POJ 2761 K-th Number (主席树入门题 区间第K大)
- poj 2104 查询区间第k小 主席树 (递归和非递归)模板
- HDU 2665 / POJ 2104 静态区间第k小 主席树
- 主席树模板 区间第k小
- poj 2104 区间第k大 主席树
- poj 2104 主席树(区间第k大)
- POJ 2104(K-th Number-区间第k大-主席树)
- POJ 2104(K-th Number-区间第k大-主席树)
- POJ 2104 K-th Number 主席树 静态区间第K大
- 【POJ 2104】(K-th Number-区间第k大-主席树)
- POJ 2104 K-th Number (主席树 静态区间第K大)
- poj 2104 K-th Number (静态区间第k大,主席树)
- [poj 2104 K-th Number] 主席树 区间第K大
- POJ 2104 K-th Number 静态区间第k大 主席树
- POJ 2104 K-th Number 主席树(求区间第k大)
- 【主席树 求区间第k大】poj 2104 K-th Number
- 数据库分区分库
- [LeetCode]Word Break
- android 实现摇一摇功能
- Java中int和Integer的区别
- 疯狂Java学习笔记(47)-----------泛型详解
- poj 2104 区间第K小 主席树入门题
- info.plist文件中各键的含义,留着用
- T3升级U8报错相关问题解决方案:
- Unity摄像机的使用四:望远镜的效果
- [转载]Z-stack 应用程序编程接口(API)-网络层
- C++学习 boost学习之-function
- opencv中实现滚动条随着视频播放移动(回调函数)
- Java 通过HttpRequest获取请求用户真实IP地址
- kali mysql重置密码