#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e6+5;
 
int n, a[maxN];
 
void solve()
{
	set<int>leaf;
	leaf.insert(a[1]);
	for(int i=2; i<=n; i+=1)
	{
		auto mn = leaf.lower_bound(a[i]);
		if(mn == leaf.begin())
		{
			cout<<"No"<<'\n';
			return;
		}
		leaf.insert(a[i]);
	}
	cout<<"Yes"<<'\n';
}
int main() {
	int test = 1;
	cin>>test;
	while(test--)
	{
		cin>>n;
		for(int i=1; i<=n; i+=1) cin>>a[i];
		solve();
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBtYXhOID0gMWU2KzU7CgppbnQgbiwgYVttYXhOXTsKCnZvaWQgc29sdmUoKQp7CglzZXQ8aW50PmxlYWY7CglsZWFmLmluc2VydChhWzFdKTsKCWZvcihpbnQgaT0yOyBpPD1uOyBpKz0xKQoJewoJCWF1dG8gbW4gPSBsZWFmLmxvd2VyX2JvdW5kKGFbaV0pOwoJCWlmKG1uID09IGxlYWYuYmVnaW4oKSkKCQl7CgkJCWNvdXQ8PCJObyI8PCdcbic7CgkJCXJldHVybjsKCQl9CgkJbGVhZi5pbnNlcnQoYVtpXSk7Cgl9Cgljb3V0PDwiWWVzIjw8J1xuJzsKfQppbnQgbWFpbigpIHsKCWludCB0ZXN0ID0gMTsKCWNpbj4+dGVzdDsKCXdoaWxlKHRlc3QtLSkKCXsKCQljaW4+Pm47CgkJZm9yKGludCBpPTE7IGk8PW47IGkrPTEpIGNpbj4+YVtpXTsKCQlzb2x2ZSgpOwoJfQoJcmV0dXJuIDA7Cn0=

OQo2CjEgMyA0IDUgMiA2CjQKMyA0IDEgMgo1CjQgMyA1IDEgMgo0CjEgMiAzIDQKNwo0IDMgNSA3IDYgMiAxCjYKMiA0IDYgMSAzIDUKMwoyIDEgMwo0CjIgNCAxIDMKNgo0IDIgNiA1IDEgMwo=

9
6
1 3 4 5 2 6
4
3 4 1 2
5
4 3 5 1 2
4
1 2 3 4
7
4 3 5 7 6 2 1
6
2 4 6 1 3 5
3
2 1 3
4
2 4 1 3
6
4 2 6 5 1 3