Cod sursa(job #1744143)
| Utilizator | Data | 19 august 2016 13:10:46 | |
|---|---|---|---|
| Problema | Nivele | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define maxN 50005
using namespace std;
int n,i,T,v[maxN];
int stk[maxN],top;
int main()
{
freopen("nivele.in","r",stdin);
freopen("nivele.out","w",stdout);
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
top=0;
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
while(top>0 && v[i]==stk[top] && v[i]>1)
top--,v[i]--;
stk[++top]=v[i];
}
if(top==1 && stk[top]==1)
printf("DA\n");
else printf("NU\n");
}
return 0;
}
