2020中国大学生程序设计竞赛（CCPC） - 网络选拔赛 Reports

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 0x3f3f3f3f;
const int N = 1000005, M = 103, mod = 1e9 + 7;
const double eps = 1e-8;
int a[55];
//相邻的两个数相同即错
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		int res = 0;
		for (int i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		int flag = 1;
		for (int i = 0; i < n-1; i++)
		{
			if (a[i] == a[i + 1])
			{
				flag = 0;
				break;
			}
		}

		if (flag)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}

	return 0;
}