Submission #1460153

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define maxn 501
#define rep(i,n) for(int i=0; i<int(n); ++i)
#define pb push_back
#define mp make_pair
#define mod 1000000007

int n, m, k, x, y, z;
vector<pair<int, int>> a;
int b[maxn * maxn];
void solve(){
	cin >> n;
	for (int i = 1; i <= n; ++i){
		cin >> x;
		a.pb(mp(x, i));
	}
	sort(a.begin(), a.end()); 
	int l = 0;
	rep(i, n){
		int pos = a[i].first;
		int num = a[i].second;
		if (b[pos] > 0){
			cout << "No";
			return;
		}
		b[pos] = num;
		rep(_, num - 1){
			while (b[++l] > 0);
			b[l] = num;
		}		
		if (l > pos){
			cout << "No";
			return;
		}
	}
	int r = n*n + 1;
	reverse(a.begin(), a.end());
	for (auto p : a){
		int pos = p.first;
		int num = p.second;
		rep(_, n - num){
			while (r >=0 && b[--r] > 0) {}
			if (r == 0){
				cout << "No";
				return;
			}
			b[r] = num;
		}
		//cout << pos << ' ' << num << ' ' << n - num << ' ' << r << endl;
		if (r < pos){
			cout << "No";
			return;
		}
	}
	cout << "Yes" << endl;
	for (int i = 1; i <= n*n; ++i){
		cout << b[i] << ' ';
	}
}

int main(int argc, char const *argv[])
{
    ios_base::sync_with_stdio(0);
    solve();
}

Submission Info

Judge Result