Envío 5926

Código

def search(arr, x):
    left = 0
    right = len(arr) - 1
    res = -1

    while left <= right:
        middle = (left + right) // 2

        if arr[middle] <= x:
            left = middle + 1
            res = middle
        else:
            right = middle - 1

    return res + 1


N = input()
arr = input().split(' ')
times = int(input())
mem = {}

for i, elem in enumerate(arr):
    if elem not in mem:
        mem[elem] = []
    mem[elem].append(i)

# print(mem)

for i in range(times):
    case = input().split(' ')
    l = int(case[0])
    r = int(case[1])
    q = case[2]
    count = 0

    if q not in mem:
        print(0)
        continue

    indexes = mem[q]

    leftIndex = search(indexes, l-1)
    rightIndex = search(indexes, r)

    # print(f'>> {leftIndex} {rightIndex} ---- {rightIndex - leftIndex}')
    print(rightIndex - leftIndex)