POJ2104-K-th Number
来源:互联网 发布:生态学现状知乎 编辑:程序博客网 时间:2024/06/05 06:58
K-th Number
Time Limit: 20000MS Memory Limit: 65536KTotal Submissions: 58245 Accepted: 20174Case 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
Hint
This problem has huge input,so please use c-style input(scanf,printf),or you may got time limit exceed.
Source
Northeastern Europe 2004, Northern Subregion
题意:给你n个数,有m次询问,每次问一个区间内第k大的数是哪个
解题思路:主席树维护即可
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <stack>#include <vector>#include <set>using namespace std;#define LL long longint n,m,q;int a[100009],x[100009];int s[100009],L[100009*20],R[100009*20],sum[100009*20];int tot;void build(int now,int l,int r,int p){ sum[++tot]=sum[now]+1; if(l==r) L[tot]=R[tot]=0; else { int mid=(l+r)>>1; L[tot]=L[now];R[tot]=R[now]; if(mid>=p) L[tot]=tot+1; else R[tot]=tot+1; if(p<=mid) build(L[now],l,mid,p); else build(R[now],mid+1,r,p); }}int query(int u,int v,int l,int r,int p){ if(l==r) return l; else { int mid=(l+r)>>1; if(p>sum[L[u]]-sum[L[v]]) return query(R[u],R[v],mid+1,r,p-sum[L[u]]+sum[L[v]]); else return query(L[u],L[v],l,mid,p); }}int main(){ while(~scanf("%d %d",&n,&q)) { for(int i=1;i<=n;i++) scanf("%d",&a[i]),x[i]=a[i]; sort(a+1,a+n+1); m=unique(a+1,a+n+1)-a; memset(s,0,sizeof s); L[0]=R[0]=sum[0]=tot=0; for(int i=1;i<=n;i++) { x[i]=lower_bound(a+1,a+m,x[i])-a; s[i]=tot+1; build(s[i-1],1,m,x[i]); } int ll,rr,kk; while(q--) { scanf("%d %d %d",&ll,&rr,&kk); printf("%d\n",a[query(s[rr],s[ll-1],1,m,kk)]); } } return 0;}
阅读全文
0 0
- [poj2104]K-th Number
- [Poj2104]K-th Number
- [POJ2104]K-th Number
- poj2104 K-th Number
- poj2104 K-th Number
- POJ2104-K-th Number
- poj2104 K-th Number
- POJ2104:K-th Number
- poj2104 K-th Number
- POJ2104 k-th number
- 【poj2104】K-th Number
- poj2104 K-th Number
- Poj2104 K-th Number
- poj2104 K-th Number
- POJ2104-K-th Number
- POJ2104-K-th Number
- poj2104 K-th Number
- POJ2104 K-th Number
- equals,“==”,hashCode的区别
- hdu 2157 How many ways??
- Android.mk文件分析
- Python之文件读写报错解析
- hdu 1061 Rightmost Digit
- POJ2104-K-th Number
- pymysql处理Unicode
- Linux文件权限小技巧
- B-POJ-3278 Catch That Cow
- stringstream-fstream-ofstream 实例
- [LeetCode] 40. Combination Sum II
- hdu 2604 Queuing
- Salty Fish
- 第一天