Ball Aizu - 0033

水题。
先遍历一遍数组，标记上升的序列。
再遍历一遍数组，看未标记的部分是否是上升的序列。

#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1e9 + 7;
const double PI = acos(-1.0);
const double eps = 1e-10;
const ll inf = 1e7;
const ll maxn = 100000 + 5;
inline ll read() {
	ll s = 0, w = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') w = -1;
	for (; isdigit(ch); ch = getchar())    s = (s << 1) + (s << 3) + (ch ^ 48);
	return s * w;
}
inline void write(ll x) {
	if (!x) {
		putchar('0');
		return;
	}
	char F[40];
	ll tmp = x > 0 ? x : -x;
	if (x < 0)putchar('-');
	int cnt = 0;
	while (tmp > 0) {
		F[cnt++] = tmp % 10 + '0';
		tmp /= 10;
	}
	while (cnt > 0)putchar(F[--cnt]);
}
inline ll gcd(ll x, ll y) {
	return y ? gcd(y, x % y) : x;
}
ll qpow(ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1)    ans *= a;
		b >>= 1;
		a *= a;
	}
	return ans;
}
ll qpow(ll a, ll b, ll mod) {
	ll ans = 1;
	while (b) {
		if (b & 1)(ans *= a) %= mod;
		b >>= 1;
		(a *= a) %= mod;
	}
	return ans % mod;
}
inline int lowbit(int x) {
	return x & (-x);
}
 
int n;

int main()
{
	cin >> n;
	while(n--)
	{
		int a[11];
		for(int i = 1; i <= 10; i++)
		{
			cin >> a[i];
		}
		
		int max = a[1];
		a[1] = -1;
		for(int i = 2; i <= 10; i++)
		{
			if(a[i] > max)
			{
				max = a[i];
				a[i] = -1;
			}
		}
		
		max = -1;
		int i;
		for(i = 1; i <= 10; i++)
		{
			if(a[i] == -1)  continue;
			if(a[i] < max)  break;
			max = a[i];
		}
		
		if(i == 11)
		  cout << "YES" << endl;
		else
		  cout << "NO" << endl;
	}
	return 0;
}