from collections import deque

def is_stackable(cubes): dq = deque(cubes) last = float('inf')

while dq:
    if dq[0] > dq[-1]:
        next = dq.popleft()
    else:
        next = dq.pop()

    if next > last:
        return "No"
    last = next

return "Yes"

t_cases = int(input())

for _ in range(t_cases): n = int(input()) cubes = list(map(int, input().split())) print(is_stackable(cubes))