字节跳动2018校招算法方向之用户喜好

if __name__ == "__main__":
 n = int(input())
 like = list(map(int,input().split()))
 q = int(input())
 check = []
 count = [0 for i in range(q)]
 for i in range(q):
     check.append(list(map(int,input().split())))
 for i in range(n): #暴力查询
     for j in range(q):
         if like[i] == check[j][2] and i+1 >= check[j][0] and i+1 <= check[j][1] :
             count[j] += 1 
 for i in range(q): #输出
     print(count[i])

import bisect
n = int(input())
likes = {}
s = list(map(int,input().split()))
for i in range(n):
 if s[i] in likes.keys():
     likes[s[i]].append(i+1)
 else:
     likes[s[i]] = [i+1]
q = int(input())
for line in range(q):
 l,r,k = map(int,input().split())
 count = 0
 if k in likes.keys():
     indexs = likes[k]
     l = bisect.bisect_left(indexs, l)
     r = bisect.bisect_right(indexs, r)
     count = r-l
     print (count)
 else:
     print (0)