#include<bits/stdc++.h> using namespace std; int t,n; const int N=200010; int b[N],pre[N],a[N],l[N]; bool vis[N]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>t; while(t--){ cin>>n; int p=0; for(int i=1;i<=n;i++) vis[i]=0,pre[i]=-1; for(int i=1;i<=n;i++){ cin>>b[i]; if(b[i]<i||b[i]<b[i-1]) p=1; } if(p==1||b[1]==n+1){ cout<<"NO\n"; continue; } for(int i=1;i<=n;i++){ if(b[i]>b[i-1]){ pre[b[i]]=i-1; vis[i-1]=true; for(int j=b[i-1];j<=b[j]-1;j++) l[j]=i; } } int top=1e9; for(int i=1;i<=n;i++) if(b[i]!=n+1) top=min(top,b[i]-i+1); queue<int> q; for(int i=1;i<=n;i++) if(!vis[i]) q.push(i); int z=0; p=1; a[0]=1; //for(int i=1;i<=n;i++) cout<<pre[i]<<" "; //cout<<endl; for(int i=1;i<=n;i++){ //cout<<"p="<<p<<" "; if(pre[i]==-1&&p<top){ a[i]=++p; //cout<<"i="<<i<<" "; } else if(pre[i]==-1){ //cout<<l[i]<<" "<<q.size()<<" "<<q.front()<<endl; while(!q.empty()&&q.front()<l[i]){ //cout<<q.front()<<" "; q.pop(); } //cout<<(q.front()>=i)<<" "<<q.front()<<" "<<i<<endl; if(q.empty()||q.front()>=i){ cout<<"NO\n"; z=1; break; } //cout<<"!"<<i<<" "<<q.front()<<" "; //cout<<i<<" "<<q.front()<<endl; a[i]=a[q.front()]; q.pop(); } else a[i]=a[pre[i]]; } if(z==1) continue; cout<<"YES\n"; for(int i=1;i<=n;i++) cout<<a[i]<<" "; cout<<"\n"; } }