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.Linq;//リストの使用
using System.Collections.Generic;
using System.Text;//テキストの高速出力に必要
class Program
{
	static void Main()
	{
		int n = int.Parse(Console.ReadLine());
    int[] nums = Array.ConvertAll(Console.ReadLine().Split(' '),int.Parse);
		int[] answers = new int[n*n];
    int[][] numPositions = new int[n][];
    for(int i = 0; i < n; i++)
    {
      numPositions[i] = new int[2];
      numPositions[i][0] = i;
      numPositions[i][1] = nums[i]-1;
    }
    Array.Sort(numPositions, (a, b) => a[1].CompareTo(b[1]));
    bool answer = true;

    answers[numPositions[0][1]] = numPositions[0][0]+1;
    for(int i = 1; i < n; i++)
    {
      if(answers[numPositions[i][1]] != 0) answer = false;
      answers[numPositions[i][1]] = numPositions[i][0]+1;
    }

    int leftNum = 0;
    int rightNum = n*n-1;
    for(int i = 0; i < n; i++)
    {
      for(int j = 0; j < numPositions[i][0]; j++)//置く個数
      {
        while(answers[leftNum] != 0)
        {
          if(leftNum < n*n-1) leftNum++;
        }
        
        if(leftNum >= numPositions[i][1])
        {
          answer = false;
          break;
        }else
        {
          answers[leftNum] = numPositions[i][0]+1;
          leftNum++;
        }
      }
    }

    for(int i = 0; i < n; i++)
    {
      for(int j = 0; j < n-numPositions[i][0]-1; j++)//置く個数
      {
        while(answers[rightNum] != 0)
        {
          if(rightNum > 0) rightNum--;
        }
        
        if(rightNum <= numPositions[i][1])
        {
          answer = false;
          break;
        }else
        {
          answers[rightNum] = numPositions[i][0]+1;
          rightNum--;
        }
      }
    }

    if(answer)
    {
      Console.WriteLine("Yes");
		  Console.WriteLine(string.Join(" ", answers));
    }else Console.WriteLine("No");
	}
}