题目大意:
给定一串数字,给定一串询问,每个询问有三个数(l,x,d),询问从l+1到l+d的大于x的数有多少。
想法:
解决这类问题可以把询问离线下来,按照x降序排,同时a也按照降序排序,x在a中遇到比自己小于之前就每次在a数组排序之前的id上update++,然后每次询问都直接记录ans因为x按照降序排序,在后面的数只会比前面的数小。
代码思路
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
//#define double long double
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define rep(i,l,r) for (int i=l;i<=r;i++)
#define nep(i,r,l) for (int i=r;i>=l;i--)
#define CIO std::ios::sync_with_stdio(false)
#define cio cin.tie(0);cout.tie(0);
//看范围,别忘了爆long long
using namespace std;
const int INF=0x3f3f3f3f;
const double eps=1e-6;
const int N=5e5+5;
const double pi=acos(-1.0);
struct aa{
int x,id;
}a[N];
struct bb{
int l,r,x,d,id;
}b[N];
int d[N],ans[N];
int lowbit(int x){
return x&(-x);
}
void update(int x,int b){
while (x<=N){
d[x]+=b;
x+=lowbit(x);
}
}
int query(int x){
int ans=0;
while (x){
ans+=d[x];
x-=lowbit(x);
}
return ans;
}
bool cmp1(aa p,aa q){
return p.x>q.x;
}
bool cmp2(bb p,bb q){
return p.x>q.x;
}
void work(){//爆long long
int y,n;cin>>y>>n;
rep(i,1,y){
cin>>a[i].x;
a[i].id=i;
}
rep(i,1,n) ans[i]=-1;
rep(i,1,n){
cin>>b[i].l>>b[i].x>>b[i].r;
b[i].r=b[i].l+b[i].r;
b[i].id=i;
if (a[b[i].l].x>=b[i].x) ans[i]=0;
}
sort(a+1,a+y+1,cmp1);
sort(b+1,b+n+1,cmp2);
int p=1;
rep(i,1,n){
while (a[p].x>=b[i].x&&p<=y){
//cout<<a[p].x<<" "<<b[i].x<<" "<<b[i].id<<endl;
update(a[p].id,1);
p++;
}
if (ans[b[i].id]==0) continue;
ans[b[i].id]=(query(b[i].r)-query(b[i].l));
}
rep(i,1,n){
cout<<ans[i]<<endl;
}
}
signed main(){
CIO;
cio;
//多组样例清空stl
//int _;cin>>_;while(_--)
{
work();
}
return 0;
}