#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define mem(a,b) memset((a),(b),sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
#define int long long
#define db long double

const double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;

void solve() {
    int n;
    cin >> n;
    vector<int>b;
    vector<int>ans;
    int flag = 1;
    for(int i = 0, x; i < n; i++) {
        cin >> x;
        if(i == 0) {
            if(x != 1) flag = 0;
            b.push_back(x);
            continue;
        }
        if(x < b.back()) flag = 0;
        else if(x > b.back() + 1) flag = 0;
        b.push_back(x);
    }
    if(flag == 0) {cout << "NO\n"; return;}
    int cnt = 1;
    for(int i = 0; i < n; i++) {
        if(i == 0) {ans.push_back(cnt);}
        else {
            if(b[i] > b[i - 1]) cnt++;
            ans.push_back(cnt);
        }
    }
    cout << "YES\n";
    for(int i = 0; i < ans.size(); i++) {
        if(i == 0) cout << ans[i];
        else cout << " " << ans[i];
    }
    cout << '\n';
}

signed main(){
   io;
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}