python 代码
from bisect import bisect, bisect_left, bisect_right
n = input().split(" ")
q = int(n[1])
n = int(n[0])
a = [int(v) for v in input().split(" ")]
l, r = 0, 0
for i in range(q):
al, ar = 0, 0
t = int(input())
l = bisect_left(a, t)
r = bisect_right(a, t)
if l >= n or a[l] != t:
al = -1
else :
al = l
if r - 1 < 0 or r -1 >= n or a[r - 1] != t:
ar = -1
else:
ar = r - 1
print(f"{al} {ar}")
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla