ural 1613 For Fans of Statistics

 #include <cstdio>
 #include <cstring>
 #include <map>
 #include <vector>
 #include <algorithm>
 using namespace std;
 map<int,vector<int> >t;
 vector<int>::iterator it;
 int main()
 {
     int n,x;
     scanf("%d",&n);
     for(int i=; i<=n; i++)
     {
         scanf("%d",&x);
         t[x].push_back(i);
     }
     int m,r,l;
     scanf("%d",&m);
     for(int i=; i<=m; i++)
     {
         scanf("%d%d%d",&l,&r,&x);
         it=lower_bound(t[x].begin(),t[x].end(),l);
         if(it==t[x].end()) printf("");
         else if((*it)<=r) printf("");
         else printf("");
     }
     printf("\n");
     return ;
 }