from itertools import permutations
from bisect import bisect_left, bisect_right
import random
import math
from collections import deque
from collections import Counter
from collections import defaultdict
inf = 1 << 60


def sgn(x):
    if x > 0:
        return 1
    elif x == 0:
        return 0
    else:
        return -1


def popC(x):
    ans = 0
    while x != 0:
        ans += x % 2
        x //= 2
    return ans


def LI():
    return list(map(int, input().split()))


def II():
    return int(input())


def SI():
    return input()


t = II()
for _ in range(t):
    n = II()
    h = LI()
    now = 0
    f = False
    if h[0] < h[1]:
        print("No")
        continue
    while h[now] > h[now+1]:
        now += 1
        if now == n-1:
            f = True
            break
    if f:
        print("No")
        continue
    while h[now] < h[now+1]:
        now += 1
        if now == n-1:
            f = True
            break
    if f:
        print("No")
        continue
    while h[now] > h[now+1]:
        now += 1
        if now == n-1:
            f = True
            break
    if f:
        print("No")
        continue
    while h[now] < h[now+1]:
        now += 1
        if now == n-1:
            f = True
            break
    if f:
        print("Yes")
        continue
    print("No")