Piling Up

from collections import deque

def can_be_piled(cubes: list) -> bool:
    cube_row = deque(map(int, cubes))
    pile = []
    while len(cube_row) > 0:
        # select the bigger of the left or right cubes
        if cube_row[0] >= cube_row[-1]:
            cube = cube_row.popleft()
        else:
            cube = cube_row.pop()
        # handle first cube
        if len(pile) == 0:
            pile.append(cube)
        # handle subsequent cubes
        else:
            if pile[-1] >= cube:
                pile.append(cube)
            else:
                return False
    return True


if __name__ == "__main__":
    num_cases = int(input())
    for _ in range(num_cases):
        cube_row = deque()
        num_cubes = int(input())
        if can_be_piled(input().split()):
            print('Yes')
        else:
            print('No')