Submission #1077686

---

Source Code Expand

#include <set>
#include <map>
#include <queue>
#include <ctime>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <bitset>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <iostream>
#include <algorithm>
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define PER(i,a,b) for(int i=(a);i>=(b);i--)
#define RVC(i,S) for(int i=0;i<(S).size();i++)
#define RAL(i,u) for(int i=fr[u];i!=-1;i=e[i].next)
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
     
template<class T> inline
void read(T& num) {
    bool start=false,neg=false;
    char c;
    num=0;
    while((c=getchar())!=EOF) {
        if(c=='-') start=neg=true;
        else if(c>='0' && c<='9') {
            start=true;
            num=num*10+c-'0';
        } else if(start) break;
    }
    if(neg) num=-num;
}
/*============ Header Template ============*/

const int maxn=(int)(3e5)+5;
int a[maxn],vi[maxn];

struct node {
	int x,v;
} p[maxn];

inline bool operator < (node a,node b) {
	return a.v!=b.v?a.v<b.v:a.x<b.x;
}

int main() {
	int n;
	read(n);
	REP(i,1,n) {
		read(p[i].v);p[i].x=i;
	} sort(p+1,p+n+1);
	int now=1;
	REP(i,1,n) {
		int c=p[i].x;
		REP(j,1,p[i].x-1) {
			while(now<p[i].v && vi[now]) now++;
			if(now>=p[i].v || vi[now]) {
				printf("No\n");return 0;
			} a[now]=c;vi[now]=1;now++;
		} a[p[i].v]=c;vi[p[i].v]=1;
	}
	now=n*n;
	PER(i,n,1) {
		int c=p[i].x;
		REP(j,1,n-p[i].x) {
			while(now>p[i].v && vi[now]) now--;
			if(now<=p[i].v || vi[now]) {
				printf("No\n");return 0;
			} a[now]=c;vi[now]=1;now--;
		}
	}
	printf("Yes\n");
	REP(i,1,n*n) printf("%d ",a[i]);putchar('\n');
	return 0;
}

Submission Info

Judge Result