# 输入同学的总数和身高 N = int(input()) heights = list(map(int, input().split())) # 这里是最长递增子序列的二分法判断 def getPos(value, B_list): left = 0 right = len(B_list)-1 while left <= right: mid = int((left + right) // 2) if B_list[mid] > value: right = mid - 1 elif...
