传送门
题目描述
马里奥是一个举世闻名的管道工,他的跳跃能力让我们钦佩。在一条长度为n的道路上,在每个整数点i的位置都有一个高度为hi的障碍物。现在的问题是:假设马里奥可以跳跃的最高高度为H,在道路的[L,R] 区间内他可以跳跃过的障碍物有多少个(不要考虑他被挡住)
分析
需要注意这道题的的范围包括0
主席树把所有的点存进去,然后二分在有序区间的位置即可
代码
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstring>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int a[N];
int n,m;
vector<int> nums;
struct Node{
int l,r;
int cnt;
}tr[N * 21];
int root[N],idx;
int find(int x){
return lower_bound(nums.begin(),nums.end(),x) - nums.begin();
}
int build(int l,int r){
int p = ++idx;
if(l == r) return p;
int mid = l + r >> 1;
tr[p].l = build(l,mid),tr[p].r= build(mid + 1,r);
return p;
}
int insert(int p,int l,int r,int x){
int q = ++idx;
tr[q] = tr[p];
if(l == r){
tr[q].cnt++;
return q;
}
int mid = l + r >> 1;
if(x <= mid) tr[q].l = insert(tr[p].l,l,mid,x);
else tr[q].r = insert(tr[p].r,mid + 1,r,x);
tr[q].cnt = tr[tr[q].l].cnt + tr[tr[q].r].cnt;
return q;
}
int query(int p,int q,int l,int r,int k){
if(l == r) return r;
int cnt = tr[tr[p].l].cnt - tr[tr[q].l].cnt;
int mid = l + r >> 1;
if(k <= cnt) return query(tr[p].l,tr[q].l,l,mid,k);
else return query(tr[p].r,tr[q].r,mid + 1,r,k - cnt);
}
int main(){
int t;
scanf("%d",&t);
for(int ppp = 1;ppp <= t;ppp++){
printf("Case %d:\n",ppp);
nums.clear();
for(int i = 0;i <= idx;i++) tr[i].cnt = 0;
idx = 0;
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 u,v,h;
int t;
scanf("%d%d%d",&u,&v,&h);
u++,v++;
int l = 0,r = v - u + 1;
while(l < r){
int mid = (l + r + 1) >> 1;
t = query(root[v],root[u - 1],0,nums.size() - 1,mid);
if(nums[t] <= h) l = mid;
else r = mid - 1;
}
printf("%d\n",l);
}
}
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/