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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using static System.Math;
using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute;
using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions;

public static class P
{
    public static void Main()
    {
        Action abort = () => { Console.WriteLine("No"); Environment.Exit(0); };
     
        int n = int.Parse(Console.ReadLine());
        var x = Console.ReadLine().Split().Select(y => int.Parse(y) - 1).ToArray();
        Queue<int> remainItem = new Queue<int>();
        int[] res = new int[n * n];
        int ind = 0;
        foreach (var item in x.Select((Index, Item) => new { Item = Item + 1, Index }).OrderBy(y => y.Item))
        {
            for (int i = 0; i < item.Item - 1; i++)
            {
                while (res[ind] != 0) ind++;
                if (item.Index <= ind) abort();
                res[ind] = item.Item;
            }
            res[item.Index] = item.Item;
            for (int i = item.Item; i < n; i++)
                remainItem.Enqueue(item.Item);
        }
        while (remainItem.Count > 0)
        {
            while (res[ind] != 0) ind++;
            var item = remainItem.Dequeue();
            if (ind < x[item - 1]) abort();
            res[ind] = item;
        }
        Debug.Assert(ind == n - 1);
        Console.WriteLine("Yes");
        Console.WriteLine(string.Join(" ", res));
    }
}