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.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

public class Program
{
    public void Solve()
    {
        int N = Reader.Int();
        var who = new int[N];
        var index = new int[N];
        for (int i = 0; i < N; i++)
        {
            who[i] = i + 1;
            index[i] = Reader.Int() - 1;
        }
        Array.Sort(index, who);
        var ans = new int[N * N];
        int L = 0;
        var rem = new List<int>();
        var bit = new BinaryIndexedTree(N * N);
        for (int i = 0; i < N * N; i++)
            bit.Add(i, 1);

        for (int i = 0; i < N; i++)
        {
            if (bit.Sum(index[i]) < who[i]) { Console.WriteLine("No"); return; }
            ans[index[i]] = who[i];
            bit.Add(index[i], -1);

            int num = who[i] - 1;
            for (; L < ans.Length && num > 0; L++)
                if (ans[L] == 0)
                {
                    num--;
                    bit.Add(L, -1);
                    ans[L] = who[i];
                }
            if (num > 0) { Console.WriteLine("No"); return; }
            for (int t = 0; t < N - who[i]; t++) rem.Add(who[i]);
        }
        int ri = 0;
        for (; L < ans.Length; L++)
            if (ans[L] == 0)
                ans[L] = rem[ri++];

        if (ri != rem.Count) { Console.WriteLine("No"); return; }
        Console.WriteLine("Yes");
        Console.WriteLine(string.Join(" ", ans));
    }
}

class BinaryIndexedTree
{
    private readonly int N;
    private readonly long[] A;

    public BinaryIndexedTree(int N)
    {
        this.N = N + 1;
        A = new long[N + 2];
    }
    public void Add(int i, long val)
    {
        if (i < 0) return;
        for (++i; i <= N; i += i & -i) A[i] += val;
    }
    public void Update(int i, long val)
    {
        Add(i, val - (Sum(i) - Sum(i - 1)));
    }
    public long Sum(int i) // [0, i]
    {
        if (i < 0) return 0;
        i = Math.Min(i + 1, N);
        long sum = 0;
        for (; i > 0; i &= i - 1) sum += A[i];
        return sum;
    }
    public long Sum(int L, int R) // [L, R)
    {
        return Sum(R - 1) - Sum(L - 1);
    }
    public int UpperBound(long val, int L = 0, int R = int.MaxValue)
    {
        for (L--, R = Math.Min(R, N); R - L > 1; )
        {
            int mid = L + R >> 1;
            if (Sum(mid) > val) R = mid;
            else L = mid;
        }
        return R;
    }
}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }
    static string[] Split(string s) { return s.Split(separator, op); }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}