90分TLE on #7求条

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+10;
ll n,q,t[N];
map<ll,vector<ll> > mp;
void solve(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&t[i]);
		mp[t[i]].push_back(i);
	}
	scanf("%lld",&q);
	for(int i=1;i<=q;i++){
		ll a,b,x,l,r;
		scanf("%lld%lld%lld",&a,&b,&x);
		ll L,R;
		L=-1,R=mp[x].size();
		while(L+1<R){
			ll mid=(L+R)/2;
			if(mp[x][mid]<a)L=mid;
			else R=mid;
		}
		l=R;
		L=-1,R=mp[x].size();
		while(L+1<R){
			ll mid=(L+R)/2;
			if(mp[x][mid]<=b)L=mid;
			else R=mid;
		}
		r=L;
		printf("%lld\n",r-l+1);
	}
	for(int i=1;i<=n;i++){
		mp[t[i]].clear();
	}
}
int main(){
	ll T;
	scanf("%lld",&T);
	while(T--)solve();
	return 0;
}