def can_be_sorted(n, array):
last_digit = 0
for number in array:
if number >= 10:
tens_digit = number // 10
units_digit = number % 10
if last_digit <= tens_digit <= units_digit:
last_digit = units_digit
elif last_digit <= number:
last_digit = number
else:
return "NO"
else:
if number >= last_digit:
last_digit = number
else:
return "NO"
return "YES"
def main():
test_cases = int(input())
for _ in range(test_cases):
length = int(input())
array = list(map(int, input().split()))
print(can_be_sorted(length, array))
if __name__ == "__main__":
main()
405A - Gravity Flip | 499B - Lecture |
709A - Juicer | 1358C - Celex Update |
1466B - Last minute enhancements | 450B - Jzzhu and Sequences |
1582C - Grandma Capa Knits a Scarf | 492A - Vanya and Cubes |
217A - Ice Skating | 270A - Fancy Fence |
181A - Series of Crimes | 1638A - Reverse |
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |