Cod sursa(job #2395949)
Utilizator | Data | 3 aprilie 2019 08:43:59 | |
---|---|---|---|
Problema | Nivele | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int n,i,j,t,x,c[50005],p,Q;
int main()
{
ifstream f("nivele.in");
ofstream g("nivele.out");
f>>Q;
for(i=1;i<=Q;i++)
{
f>>n>>x;
p=t=1;
c[p]=x;
for(j=2;j<=n;j++)
{
f>>x;
c[++t]=x;
while(c[t]==c[t-1])
{
t--;
c[t]--;
}
}
if(t!=1)
g<<"NU"<<'\n';
else
g<<"DA"<<'\n';
}
return 0;
}