Cod sursa(job #3135902)
Utilizator | Data | 4 iunie 2023 17:37:52 | |
---|---|---|---|
Problema | Nivele | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 5e4+2;
int t,n,x,vf,st[NMAX];
ifstream fin("nivele.in");
ofstream fout("nivele.out");
int main()
{
fin >> t;
while(t--){
fin >> n;
for(int i = 1; i <= n; i++){
fin >> x;
st[++vf] = x;
while(vf > 1 && st[vf] == st[vf-1]){
st[vf-1]--;
vf--;
}
}
fout << ((vf == 1 && st[vf] == 1) ? "DA" : "NU") << "\n";
}
return 0;
}