What is wrong in my code (MAX-QUERY 1)

#1

#include
#include <bits/stdc++.h>
#include
#define lld long long int
#define all(v) v.begin(),v.end()
using namespace std;
const int MAXN=1e5+5;
vector tree[4MAXN+1];
vector merge(vector a,vector b)
{
vector r;
for(int i=0;i<a.size();i++)
{
r.push_back(a[i]);
}
for(int i=0;i<b.size();i++)
{
r.push_back(b[i]);
}
sort(r.begin(),r.end());
return r;
}
void buildTree(lld a,lld s,lld e,lld index)
{
if(s == e)
{
tree[index].push_back(a[s]);
return ;
}
lld mid=(s+e)>>1;
buildTree(a,s,mid,2index);
buildTree(a,mid+1,e,2index+1);
tree[index] = merge(tree[2index],tree[2index+1]);
return ;
}
lld query(lld s,lld e,lld qs,lld qe,lld k,lld index)
{
if(s > qe || e < qs)
{
return 0;
}
if(s >= qs && e <= qe)
{
lld p=tree[index].end()-upper_bound(all(tree[index]),k);
lld q=lower_bound(all(tree[index]),k)-tree[index].begin();
lld r=upper_bound(all(tree[index]),k)-tree[index].begin();
return p+(r-q);
}
lld mid=(s+e)>>1;
lld la=query(s,mid,qs,qe,k,2index);
lld ra=query(mid+1,e,qs,qe,k,2index+1);
return la+ra;
}
int main()
{
lld n,q;
cin >> n;
lld a[n];
for(int i=0;i<n;i++)
{
cin >> a[i];
}
buildTree(a,0,n-1,1);
cin >> q;
while(q–)
{
lld l,r,k;
cin >> l >> r >> k;
cout<<query(0,n-1,l,r,k,1)<<endl;
}
}

#2

Refer this you will get the correct logic.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.