Problem:
Score : 800 points

Problem Statement

You are given an integer sequence x of length N.
Determine if there exists an integer sequence a that satisfies all of the following conditions, and if it exists, construct an instance of a.

a is N^2 in length, containing N copies of each of the integers 1, 2, ..., N.

For each 1 ≤ i ≤ N, the i-th occurrence of the integer i from the left in a is the x_i-th element of a from the left.

Constraints

1 ≤ N ≤ 500

1 ≤ x_i ≤ N^2

All x_i are distinct.

Input

The input is given from Standard Input in the following format:

N
x_1 x_2 ... x_N

Output

If there does not exist an integer sequence a that satisfies all the conditions, print No.
If there does exist such an sequence a, print Yes in the first line, then print an instance of a in the second line, with spaces inbetween.

Sample Input 1

3
1 5 9

Sample Output 1

Yes
1 1 1 2 2 2 3 3 3

For example, the second occurrence of the integer 2 from the left in a in the output is the fifth element of a from the left.
Similarly, the condition is satisfied for the integers 1 and 3.

Sample Input 2

2
4 1

Sample Output 2

No

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
 
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long 
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
 
#define y1 what

using namespace std;
 
const int N = (int) 505;
const int M = (int) 2e6 + 10;
const ll big =  (1LL << 51);
const ll LINF = (ll) 1e18;
const int INF = (int) 1e9 + 7;
const double EPS = (double) 1e-6;
const double PI =  3.14159265359;

int n;
int ans[N * N], cnt[N];
pii a[N];

int main() {
    #define fn "balls"
    #ifdef witch
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
//        freopen(fn".in", "r", stdin);
//        freopen(fn".out", "w", stdout);
    #endif
    srand(time(0));
    /*
    n = rand() % 10 + 1;
    vector<int> perm;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            perm.pb(i);
        }
    }
    random_shuffle(perm.begin(), perm.end());
    cout << n << endl;
    for (auto it : perm) {
        cout << it << " ";
    } cout << "\n";
    */
    cin >> n;   
    for (int i = 1; i <= n; i++) {
    /*
        for (int j = 0, cnt = 0; j < perm.size(); j++) {
            if (perm[j] == i) {
                cnt++;
            }
            if (cnt == i) {
                a[i].f = j + 1;
                break;
            }
        }
        cout << a[i].f << "\n";
    */
        cin >> a[i].f;
        a[i].s = i;
    }
    //cout << "-------------\n";
    memset(ans, -1, sizeof(ans));
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) {
        int cnt = a[i].s;
        if (ans[a[i].f] != -1) {
            cout << "No";
            return 0;
        }
        ans[a[i].f] = a[i].s;
        --cnt;
        for (int j = 1; j < a[i].f && cnt > 0; j++) {
            if (ans[j] == -1) {
                ans[j] = a[i].s;
                --cnt;
            }
        }
        if (cnt > 0) {
            cout << "No";
            return 0;
        }
    }
    /*
    for (int i = 1; i <= n * n; i++) {
        cout << ans[i] << " ";
    }
    cout << "\n";
    */
    for (int i = 1; i <= n * n; i++) {
        if (ans[i] == -1) {
            for (int j = 1; j <= n; j++) {
                if (cnt[j] >= j && cnt[j] < n) {
                    ans[i] = j;
                    break;
                }
            }
            if (ans[i] == -1) {
                cout << "No";
                return 0;
            }
        }
        cnt[ans[i]]++;
    }
    cout << "Yes\n";
    for (int i = 1; i <= n * n; i++) {
        cout << ans[i] << " ";
    }
    return 0;
}