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: Runtime Error)

#include<bits/stdc++.h>

using namespace std;
const int N=500+7;
struct Node{
    int ind,val;
}node[N];
int a[N*N];
int cmp(Node a,Node b)
{
    return a.ind<b.ind;
}
int main()
{
    int n;
    memset(a,0,sizeof(a));
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&node[i].ind);
        node[i].val=i;
    }
    sort(node+1,node+n+1,cmp);
    int flag=1,top=1;
    for(int i=1;i<=n&&flag;i++)
    {
        int ind=node[i].ind,val=node[i].val;
        a[ind]=val;
        for(int j=1;j<=i-1;j++)
        {
            while(a[top++]);
            a[top++]=val;
        }
        if(top>ind)
            flag=0;
    }
    for(int i=1;flag&&i<=n;i++)
    {
        int ind=node[i].ind,val=node[i].val;
        a[ind]=val;
        for(int j=1;j<=n-i;j++)
        {
            while(a[top++]);
            a[top++]=val;
        }
        if(top<ind)
            flag=0;
    }
    if(flag)
        puts("Yes");
    else
        puts("No");
    return 0;
}