#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
const int MAXN = 30010;
const int M = MAXN * 100;
int n,q,tot;
int a[MAXN];
int T[M],lson[M],rson[M],c[M];
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 = n;
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 root,int pos){
int ret = 0;
int l = 1, r = n;
while(pos < r){
int mid = (l+r)>>1;
if(pos <= mid){
r = mid;
root = lson[root];
}
else{
ret += c[lson[root]];
root = rson[root];
l = mid+1;
}
}
return ret + c[root];
}
int main(){
while(scanf("%d",&n) == 1){
tot = 0;
for(int i = 1;i <= n;i++)
scanf("%d",&a[i]);
T[n+1] = build(1,n);
map<int,int>mp;
for(int i = n;i>= 1;i--){
if(mp.find(a[i]) == mp.end()){
T[i] = update(T[i+1],i,1);
}
else{
int tmp = update(T[i+1],mp[a[i]],-1);
T[i] = update(tmp,i,1);
}
mp[a[i]] = i;
}
scanf("%d",&q);
while(q--){
int l,r;
scanf("%d%d",&l,&r);
printf("%d\n",query(T[l],r));
}
}
return 0;
}
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
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 dis(){
for(int i = 0 ;i< tot ;i++){
cout<<i<<" "<<a[i]<<" "<<t[i]<<" "<<T[i]<<" "<<lson[i]<<" "<<rson[i]<<" "<<c[i]<<endl;
}
cout<<endl;
}
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 ){
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)]);
}
}
return 0;
}
待补
LCA + 主席树 = 树上路径点值第k大
树状数组 + 主席树 = 动态区间第k大