首页 > 代码库 > POJ2761 Feed the dogs

POJ2761 Feed the dogs

2024-08-31 21:29:25   217人阅读

本文版权归ljh2000和博客园共有，欢迎转载，但须保留此声明，并给出原文链接，谢谢合作。

 

 

本文作者：ljh2000 
作者博客：http://www.cnblogs.com/ljh2000-jump/
转载请注明出处，侵权必究，保留最终解释权！

 

Description

Wind loves pretty dogs very much, and she has n pet dogs. So Jiajia has to feed the dogs every day for Wind. Jiajia loves Wind, but not the dogs, so Jiajia use a special way to feed the dogs. At lunchtime, the dogs will stand on one line, numbered from 1 to n, the leftmost one is 1, the second one is 2, and so on. In each feeding, Jiajia choose an inteval[i,j], select the k-th pretty dog to feed. Of course Jiajia has his own way of deciding the pretty value of each dog. It should be noted that Jiajia do not want to feed any position too much, because it may cause some death of dogs. If so, Wind will be angry and the aftereffect will be serious. Hence any feeding inteval will not contain another completely, though the intervals may intersect with each other. 

Your task is to help Jiajia calculate which dog ate the food after each feeding. 

Input

The first line contains n and m, indicates the number of dogs and the number of feedings. 

The second line contains n integers, describe the pretty value of each dog from left to right. You should notice that the dog with lower pretty value is prettier. 

Each of following m lines contain three integer i,j,k, it means that Jiajia feed the k-th pretty dog in this feeding. 

You can assume that n<100001 and m<50001. 

Output

Output file has m lines. The i-th line should contain the pretty value of the dog who got the food in the i-th feeding.

Sample Input

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

Sample Output

3
2


正解：主席树
解题报告：
　　主席树裸题，维护区间第k大数查询。
　　
//It is made by ljh2000
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <ctime>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
const int MAXN = 100011;
int n,m,a[MAXN],c[MAXN],L,cnt,root[MAXN];
struct node{ int ls,rs,val; }tr[MAXN*20];
inline int getint(){
    int w=0,q=0; char c=getchar(); while((c<‘0‘||c>‘9‘) && c!=‘-‘) c=getchar();
    if(c==‘-‘) q=1,c=getchar(); while (c>=‘0‘&&c<=‘9‘) w=w*10+c-‘0‘,c=getchar(); return q?-w:w;
}

inline int build(int rt,int l,int r,int k){	
	cnt++; tr[cnt]=tr[rt]; tr[cnt].val++; if(l==r) return cnt;
	int cc=cnt; int mid=(l+r)>>1;
	if(k<=mid) tr[cc].ls=build(tr[rt].ls,l,mid,k);
	else tr[cc].rs=build(tr[rt].rs,mid+1,r,k);
	return cc;
}

inline int query(int up,int down,int l,int r,int k){
	if(l==r) return l; int cp=tr[ tr[up].ls ].val-tr[ tr[down].ls ].val; int mid=(l+r)>>1;
	if(k<=cp) return query(tr[up].ls,tr[down].ls,l,mid,k);
	else return query(tr[up].rs,tr[down].rs,mid+1,r,k-cp);
}

inline void work(){
	n=getint(); m=getint(); for(int i=1;i<=n;i++) a[i]=getint(),c[i]=a[i];
	sort(c+1,c+n+1); L=unique(c+1,c+n+1)-c-1;
	for(int i=1;i<=n;i++) a[i]=lower_bound(c+1,c+L+1,a[i])-c;
	for(int i=1;i<=n;i++) root[i]=build(root[i-1],1,L,a[i]);
	int l,r,k;
	while(m--) {
		l=getint(); r=getint(); k=getint();
		printf("%d\n",c[ query(root[r],root[l-1],1,L,k) ]);
	}
}

int main()
{
    work();
    return 0;
}

　　

POJ2761 Feed the dogs


联系
我们