poj2104
来源:互联网 发布:angela baby 知乎 编辑:程序博客网 时间:2024/04/30 08:07
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 51717 Accepted: 17714Case 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
裸主席树
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,size,tot,q;
int root[100001],a[100001],ls[8000001],rs[8000001],s[8000001];
int num[100001],hash[100001];
int find(int F)
{
int l=1,r=tot,mid,ans;
for (;l<=r;)
{
mid=(l+r)>>1;
if (hash[mid]==F)
{
ans=mid;
break;
}
else if (hash[mid]>F) r=mid-1;
else l=mid+1;
}
return ans;
}
int read()
{
int x=0,f=1;char ch=getchar();
for (;ch>'9'||ch<'0';ch=getchar()) if (ch=='-') f=-1;
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x*f;
}
void add(int l,int r,int x,int &y,int v)
{
y=++size;
s[y]=s[x]+1;
if (l==r) return;
int mid=(l+r)>>1;
ls[y]=ls[x];rs[y]=rs[x];
if (v<=mid) add(l,mid,ls[x],ls[y],v);
else add(mid+1,r,rs[x],rs[y],v);
}
int query(int l,int r,int x,int y,int v)
{
if (l==r) return l;
int mid=(l+r)>>1;
if (v<=s[ls[y]]-s[ls[x]]) return query(l,mid,ls[x],ls[y],v);
else return query(mid+1,r,rs[x],rs[y],v-(s[ls[y]]-s[ls[x]]));
}
int main()
{
n=read();q=read();
for (int i=1;i<=n;i++) a[i]=read(),num[i]=a[i];
sort(num+1,num+n+1);
hash[++tot]=num[1];
for (int i=2;i<=n;i++)
if (num[i]!=num[i-1]) hash[++tot]=num[i];
for (int i=1;i<=n;i++)
add(1,tot,root[i-1],root[i],find(a[i]));
for (;q--;)
{
int l,r,k;l=read();r=read();k=read();
printf("%d\n",hash[query(1,tot,root[l-1],root[r],k)]);
}
return 0;
}
0 0
- poj2104
- poj2104
- poj2104
- poj2104
- poj2104
- poj2104
- poj2104 划分树
- poj2104(划分树)
- poj2104 hdu2665 划分树
- [poj2104]K-th Number
- poj2104(主席树)
- [Poj2104]K-th Number
- POJ2104 归并树
- 主席树POJ2104
- 线段树基础 poj2104
- 【线段树专题】poj2104
- 划分树 poj2104 hdu5249
- [POJ2104]K-th Number
- [编程题]图片整理
- ExecuteScalar()方法
- 机器学习_线性回归,梯度下降算法与正规方程
- 字符串同构问题——leetcode205/leetcode290
- python的魔法方法
- poj2104
- 微信小程序
- LBP(四)
- Hrbust 1688 数论中的异或【思维+数论异或】好题~
- bzoj 3223 splay模板 【pascal】
- 欢迎使用CSDN-markdown编辑器
- 欢迎使用CSDN-markdown编辑器
- Qt mingw编译MySQL驱动和连接MySQL数据库
- Shell脚本并杀死进程