原题链接
题意:大意是求区间内大于等于某个数的个数。这个题有个坑,就是给你l,r,但是查询的是l + 1 ~ r,因为那些人只有退役之后才会关注别人,所以需要细节~~~
解法:树状数组。询问和数组统一按降序排,维护一个指针q代表当前合法的a[i]在哪里(当前a[i]val值小于询问的val值),指针不断移动不断更新即可,注意更新的是a[i]的下标(id),然后查询的是query® - query(l),代表l + 1到r之中满足条件的点数,最后区间长度减去不满足条件的点就是答案了。当然你也可以直接按升序排直接query出答案,我这里其实写麻烦了。
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define endl '\n'
const int maxn = 3e5 + 5;
int s[maxn],n,m,ans[maxn];
int lowbit(int x){
return -x & x;
}
int query(int x){
int ans = 0;
while (x){
ans += s[x];
x -= lowbit(x);
}
return ans;
}
void update(int pos){
while (pos <= n){
s[pos] ++;
pos += lowbit(pos);
}
}
struct node{
int l,r,val,id;
friend bool operator < (const node a,const node b){
return a.val < b.val;
}
}a[maxn],b[maxn];
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 1;i <= n;i ++){
cin >> a[i].val;
a[i].id = i;
}
memset(ans,-1,sizeof ans);
for (int i = 1; i <= m; ++i) {
cin >> b[i].l >> b[i].val >> b[i].r;
b[i].id = i;
b[i].r += b[i].l;
if(a[b[i].l].val >= b[i].val) ans[i] = 0;
}
sort(a + 1,a + 1 + n);
int q = 1;
sort(b + 1,b + 1 + m);
for (int i = 1; i <= m; ++i) {
while(a[q].val < b[i].val && q <= n ){
update(a[q].id);
q++;
}
if (ans[b[i].id] == 0) continue;
ans[b[i].id] = (b[i].r - b[i].l) - (query(b[i].r) - query(b[i].l));
}
for (int i = 1; i <= m; ++i) {
cout << ans[i] << endl;
}
}