Pagini recente » Cod sursa (job #1144893) | Cod sursa (job #3204199) | Cod sursa (job #3290489) | Cod sursa (job #2312047) | Cod sursa (job #2975433)
//#include<iostream>
#include<vector>
#include<fstream>
#include<queue>
std::ifstream cin("nivele.in");
std::ofstream cout("nivele.out");
using namespace std;
void solve() {
int n, ok = 0;
cin >> n;
vector<int>v(n + 1);
for (int i = 1; i <= n; i++) cin >> v[i];
for (int i = n - 1; i >= 1; i--) ok += (v[i] == v[i + 1]);
if (v[n] != v[n - 1]) ok = 1;
if (!ok) cout << "DA";
else cout << "NU";
cout << '\n';
}
int main() {
int t;
cin >> t;
while (t--) solve();
return 0;
}