Submission #1856958

---

Source Code Expand

#include"bits/stdc++.h"


#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
#define RREP(x,l,u) for(int x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;

const int maxn = 300010;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);

template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}

int n;

PII A[maxn];

int Ans[maxn];

vector<int> has;

void Work(){
	int now=1;
	REP(i,1,n){
		int x=A[i].se,y=A[i].fi;
		Ans[y]=x;
		REP(j,1,x-1){
			while(Ans[now])now++;
			Ans[now++]=x;
		}
		if(now>y){
			puts("No");return;
		}
	}
	while(Ans[now])now++;
	REP(i,1,n){
		int x=A[i].se;
		REP(j,1,n-x)has.PB(i);
	}
	int now2=0;
	while(now<=n*n){
		if(A[has[now2]].fi>now){
			puts("No");
			return;
		}
		Ans[now]=A[has[now2]].se;
		now2++;
		while(Ans[now])now++;
	}
	puts("Yes");
	REP(i,1,n*n)printf("%d ",Ans[i]);
}

void Init(){
	read(n);
	REP(i,1,n)read(A[i].fi),A[i].se=i;
	sort(A+1,A+n+1);
}

int main(){
	Init();
	Work();
	return 0;
}

Submission Info

Judge Result