# SPOJ : KQUERY – K-query

Problem Link : http://www.spoj.com/problems/KQUERY/en/

```
/*
+-+ +-+ +-+
|R| |.| |S|
+-+ +-+ +-+
*/

#include &lt;bits/stdc++.h&gt;

#define pii             pair &lt;int,int&gt;
#define sc              scanf
#define pf              printf
#define Pi              2*acos(0.0)
#define ms(a,b)         memset(a, b, sizeof(a))
#define pb(a)           push_back(a)
#define MP              make_pair
#define db              double
#define ll              long long
#define EPS             10E-10
#define ff              first
#define ss              second
#define sqr(x)          (x)*(x)
#define D(x)            cout&lt;&lt;#x &quot; = &quot;&lt;&lt;(x)&lt;&lt;endl
#define VI              vector &lt;int&gt;
#define DBG             pf(&quot;Hi\n&quot;)
#define MOD             100007
#define MAX             10000
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define SZ(a)           (int)a.size()
#define sf(a)           scanf(&quot;%d&quot;,&amp;a)
#define sfl(a)          scanf(&quot;%lld&quot;,&amp;a)
#define sff(a,b)        scanf(&quot;%d %d&quot;,&amp;a,&amp;b)
#define sffl(a,b)       scanf(&quot;%lld %lld&quot;,&amp;a,&amp;b)
#define sfff(a,b,c)     scanf(&quot;%d %d %d&quot;,&amp;a,&amp;b,&amp;c)
#define sfffl(a,b,c)    scanf(&quot;%lld %lld %lld&quot;,&amp;a,&amp;b,&amp;c)
#define loop(i,n)       for(int i=0;i&lt;n;i++)
#define REP(i,a,b)      for(int i=a;i&lt;b;i++)
#define TEST_CASE(t)    for(int z=1;z&lt;=t;z++)
#define PRINT_CASE      printf(&quot;Case %d: &quot;,z)
#define CASE_PRINT      cout&lt;&lt;&quot;Case &quot;&lt;&lt;z&lt;&lt;&quot;: &quot;;
#define all(a)          a.begin(),a.end()
#define intlim          2147483648
#define inf             1000000
#define ull             unsigned long long

using namespace std;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

//int Set(int N,int pos){return N=N | (1&lt;&lt;pos);}
//int reset(int N,int pos){return N= N &amp; ~(1&lt;&lt;pos);}
//bool check(int N,int pos){return (bool)(N &amp; (1&lt;&lt;pos));}
/*------------------------------------------------*/

struct data
{
int val, idx, ans,l,r;
bool q;
data(int a, int b, bool p=0,int tans=0,int lo=0,int rr=0)
{
val=a,idx=b,q=p,ans=tans,l=lo,r=rr;
}
};

vector&lt;data&gt;v;

bool comp(data a, data b)
{
if(a.val==b.val)
{
return a.idx&gt;b.idx;
}
else
return a.val&gt;b.val;
}

bool recomp(data a, data b)
{
return a.idx&lt;b.idx;
}

int tree[30005];
int ans[200005];
void update(int idx, int val, int nn)
{
while(idx&lt;=nn)
{
tree[idx]+=val;
idx+= (idx &amp; -idx);
}
}

int query(int idx)
{
int sum=0;
while(idx&gt;0)
{
sum+=tree[idx];
idx-=(idx &amp; -idx);
}
return sum;
}

int main()
{
///freopen(&quot;in.txt&quot;,&quot;r&quot;,stdin);
///freopen(&quot;out.txt&quot;,&quot;w&quot;,stdout);
int n;
sf(n);
for(int i=1; i&lt;=n; i++)
{
int a;
sf(a);
v.push_back(data(a,i));
}

int m;
sf(m);
for(int i=1; i&lt;=m; i++)
{
int a,b,c;
sfff(a,b,c);
v.push_back(data(c,n+i,1,0,a,b));

}

sort(all(v),comp);

for(int i=0; i&lt;SZ(v); i++)
{
if(v[i].q)
{
ans[v[i].idx-n-1]= query(v[i].r)-query(v[i].l-1);
}
else
{
update(v[i].idx,1,n);
}
}

for(int i=0; i&lt;m; i++)
{
pf(&quot;%d\n&quot;,ans[i]);
}

return 0;
}

```