t = int(input())
for _ in range(t):
    n = int(input())
    blocks = list(map(int, input().split()))
    left, right = 0, n - 1
    last = float('inf')   # start with "infinity" (no restriction yet)
    ok = True
    
    while left <= right:
        # choose the bigger cube from either end
        if blocks[left] >= blocks[right]:
            curr = blocks[left]
            left += 1
        else:
            curr = blocks[right]
            right -= 1
        
        # check if it's valid
        if curr > last:
            ok = False
            break
        last = curr
    
    print("Yes" if ok else "No")