1023D. Array Restoration

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dprintf if (debug) printf
#define rep(i, j, k) for (int i=j; i<k; i++)
const int debug = 0;
const int maxn = 2e5+50;
const int INF = 0x3f3f3f3f;
int n, q, a[maxn], lmost[maxn], rmost[maxn], exist[maxn], tot[maxn];
int minn[maxn*4], colored[maxn], colorcnt, minx;
vector<int> unc;
void build(int o, int l, int r){
	if (l == r){
		minn[o] = a[l];
		return;
	}
	int mid = l+r>>1;
	build(o<<1, l, mid); build(o<<1|1, mid+1, r);
	minn[o] = min(minn[o<<1], minn[o<<1|1]);
}
int query(int o, int l, int r, int ql, int qr){
	dprintf("query %d %d %d %d\n", l, r, ql, qr);
	if (ql<=l && qr >= r){
		return minn[o];
	}
	int mid = l+r>>1;
	int ans = INF;
	if (ql<=mid) ans = min(query(o<<1, l, mid, ql, qr), ans);
	if (qr>=mid+1) ans = min(query(o<<1|1, mid+1, r, ql, qr), ans);
	return ans;
}

int main(){
	scanf("%d%d", &n, &q);
	rep(i, 1, n+1){
		scanf("%d", &a[i]);
	}
	rep(i, 0, q+1){
		lmost[i] = INF;
		rmost[i] = -INF;
	}
	rep(i, 1, n+1){
		if (a[i] == 0) {
			a[i] = INF;
			continue;}
		if (i < lmost[a[i]]){
			lmost[a[i]] = i;
		}
		if (i > rmost[a[i]]){
			rmost[a[i]] = i;
		}
		tot[a[i]]++;
	}


	build(1, 1, n);
	int processed = 0, qshow = 0;
	for (int i=q; i>=1; i--){ 

		if (lmost[i] == INF || rmost[i] == -INF){
			unc.push_back(i);
			continue;
		} 
		if (i==q) qshow = 1;
		processed = 1;
		colored[i] = 1;
		colorcnt++;
		minx = query(1, 1, n, lmost[i], rmost[i]);
		if (minx < i) {
			puts("NO");
			return 0;
		}
	}
	a[0] = 1;
	if (!processed){
		rep(i, 1, n+1){
			a[i] = q;
		}
		qshow = 1;
	}
	else{
		if (!qshow){
			rep(i, 1, n+1){
				if (a[i] == INF) {
					a[i] = q; 
					qshow = 1;
					break;
				}
			}
		}
		rep(i, 1, n+1){
			if (a[i] == INF) a[i] = a[i-1];
		}
	}
	if (!qshow){
		puts("NO");
		return 0;
	}
	puts("YES");
	rep (i, 1, n+1){
		printf("%d ", a[i]);
	}

}