Cod sursa(job #1416153)
| Utilizator | Data | 7 aprilie 2015 14:50:56 | |
|---|---|---|---|
| Problema | Nivele | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include<fstream>
using namespace std;
int n, t, u, a, i;
int v[50002], s[50002];
ifstream fin("nivele.in");
ofstream fout("nivele.out");
int main(){
fin>> t;
for(; t; t--){
fin>> n;
for(i = 1; i <= n; i++){
fin>> v[i];
}
u = 1;
s[1] = v[1];
for(i = 2; i <= n; i++){
a = v[i];
while(u > 0 && a == v[u]){
a--;
u--;
}
u++;
v[u] = a;
}
if(u == 1 && v[u] == 1){
fout<<"DA\n";
}
else{
fout<<"NU\n";
}
}
return 0;
}
