Submission #1799339

---

Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
inline int read()
{
	int x;char c;
	while((c=getchar())<'0'||c>'9');
	for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=x*10+c-'0';
	return x;
}
#define MN 500
struct P{int z,t,k;}p[MN+5];
bool cmp(const P&a,const P&b){return a.k<b.k;}
int s[MN+5],x[MN*MN+5];
int main()
{
	int n=read(),i,j,k;
	for(i=1;i<=n;++i)p[i].z=i,p[i].t=i-1,x[p[i].k=read()]=i,s[i]=n-i;
	sort(p+1,p+n+1,cmp);
	for(i=j=k=1;i<=n*n;++i)if(!x[i])
	{
		while(j<=n&&!p[j].t)++j;
		if(j<=n){if(i>p[j].k)return 0*puts("No");x[i]=p[j].z;--p[j].t;}
		else{while(!s[k])++k;x[i]=k;}
	}
	puts("Yes");
	for(i=1;i<=n*n;++i)printf("%d ",x[i]);
}

Submission Info

Judge Result