Submission #1382857

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
const int N = 2501;
int n, a, b[N], c[N], cnt;
queue <int> q, qu;
int main(){
    cin >> n;
    for(int i = 1;i <= n; ++ i){
        cin >> a;
        b[a] = i;
        c[a] = n - i + 1;
    }
    for(int i = 1;i <= n * n; ++ i){
        if(!b[i]){
            ++cnt;
            continue;
        }
        if(cnt < b[i] - 1){
            cout << "No";
            return 0;
        }
        cnt -= b[i] - 1;
        for(int j = 1;j < b[i]; ++ j)q.push(b[i]);
    }
    cnt = 0;
    for(int i = n * n;i >= 1; -- i){
        if(!c[i]){
            ++cnt;
            continue;
        }
        if(cnt < c[i] - 1){
            cout << "No";
            return 0;
        }
        cnt -= c[i] - 1;
        for(int j = 1;j < c[i]; ++ j)qu.push(n - c[i] + 1);
    }
    for(int i = 1;i <= n * n && sz(q) != 0; ++ i){
        if(!b[i]){
            b[i] = q.front();
            q.pop();
        }
    }
    for(int i = n * n;i >= 1 && sz(qu) != 0; -- i){
        if(!b[i]){
            b[i] = qu.front();
            qu.pop();
        }
    }
    cout << "Yes\n";
    for(int i = 1;i <= n * n; ++ i)cout << b[i] << " ";
    return 0;
}

Submission Info

Judge Result