1.数数
肉眼可见的裸题,唯一需要思考的地方就是如何确定范围,不妨如此思考,我们已经知道寻找第k小数的方法,那么我们不妨先朴素的想:枚举区间第1小,第二小。。。。看看到哪都比H小,不就是这题的答案吗,因此,利用单调性,不妨使用二分法,确定端点,就是答案了。代码如下:
#include<iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 100010;
int T;
int n, m;
struct SegmentTree
{
int lc,rc;
int cnt;
}tree[N * 4 + N * 17];
int tot,root[N];
int a[N];
vector<int> nums;
int find(int x)
{
return lower_bound(nums.begin(), nums.end(), x) - nums.begin();
}
int build (int l, int r)
{
int p = ++tot;
if (l == r) return p;
int mid = (l + r) >> 1;
tree[p].lc = build(l, mid), tree[p].rc = build(mid+1, r);
return p;
}
int insert(int now,int l,int r,int x) //单点修改
{
int p = ++tot;
tree[p]= tree[now];
if(l == r)
{
tree[p].cnt++;
return p;
}
int mid =(l+r) >> 1;
if(x <= mid) tree[p].lc = insert(tree[now].lc,l,mid,x);
else
tree[p].rc = insert(tree[now].rc,mid + 1,r,x);
tree[p].cnt = tree[tree[p].lc].cnt + tree[tree[p].rc].cnt;
return p;
}
int ask(int q,int p,int l,int r,int k)
{
if(l == r) return r;
int cnt = tree[tree[q].lc].cnt - tree[tree[p].lc].cnt;
int mid = (l + r )>>1;
if(k <= cnt) return ask(tree[q].lc,tree[p].lc,l,mid,k);
return ask(tree[q].rc,tree[p].rc,mid + 1,r,k - cnt); //当前已经统计了cnt个数了。
}
int main()
{
scanf("%d",&T);
while(T--){
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ )
{
scanf("%d", &a[i]);
nums.push_back(a[i]);
}
sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(),nums.end()),nums.end());
root[0] = build(0,nums.size() - 1);//用离散化后的数值建立可持久化线段树
for(int i = 1 ; i <= n; i++) root[i] = insert(root[i-1], 0, nums.size() - 1, find(a[i]));
for(int i = 1 ; i <= m ; i++)
{
int l, r, aq;
scanf("%d%d%d", &l, &r, &aq);
int lc = 0 , rc = r - l + 1 ;
while( lc < rc)
{
int mid = (lc + rc + 1) >> 1;
if(nums[ask(root[r], root[l-1], 0, nums.size()-1, mid)] <= aq) lc = mid;
else rc = mid - 1;
}
printf("%d\n",lc);
}
}
return 0;
}