Cod sursa(job #1152987)
| Utilizator | Data | 25 martie 2014 10:15:58 | |
|---|---|---|---|
| Problema | Nivele | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<stdio.h>
#define nmax 50005
int n, t, i, x, sf;
int st[nmax];
int main()
{
freopen("nivele.in","r",stdin);
freopen("nivele.out","w",stdout);
scanf("%ld",&t);
while (t)
{
t--;
scanf("%ld",&n);
sf=0;
for (i=1;i<=n;i++)
{
scanf("%ld",&x);
while ((st[sf]==x)&&(sf>=1))
{ sf--; x--; }
st[++sf]=x;
}
if ((sf==1)&&(st[1]==1))
printf("DA\n");
else
printf("NU\n");
}
return 0;
}
