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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)


import java.util.Arrays;
import java.util.Scanner;

/**
 * Created by sonetsuyoshi on 2016/07/31.
 */
public class Main {

    static class Num implements Comparable<Num>{
        int num, v;
        Num(int num, int v) {
            this.num = num;
            this.v = v;
        }

        @Override
        public int compareTo(Num o) {
            return v;
        }
    }

    static public void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int N = n * n;
        Num[] arr = new Num[n + 1];
        for(int i = 1; i <= n; i++) {
            arr[i] = new Num(i, sc.nextInt());
        }

        Arrays.sort(arr);
        int m = 0;
        int l = 1;

        boolean solvable = true;
        for(int i = 1; i <= n; i++) {
            int x = (i - 1) * n + i;
            m+=l;
            l++;
            if(m > arr[i].v || x < arr[i].v) solvable = false;
        }

        if(solvable) {
            int[] ans = new int[N];
            for(int i = 1; i <= n; i++) {
                if(ans[arr[i].v - 1] > 0) {
                    System.out.println("No");
                    return;
                }
                ans[arr[i].v - 1] = arr[i].num;
            }

            int cursor = 0;
            for(int i = 1; i <= n; i++) {
                for(int j = 1; j < i; j++) {
                    while(ans[cursor] > 0) cursor++;
                    ans[cursor] = arr[i].num;
                }
            }
            for(int i = 1; i <= n; i++) {
                for(int j = 1; j <= n - i; j++) {
                    while(ans[cursor] > 0) cursor++;
                    ans[cursor] = arr[i].num;
                }
            }
            System.out.println(Arrays.toString(ans));
        } else {
            System.out.println("No");
        }
    }
}