題目:
https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4498
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
| #include <bits/stdc++.h>
#define MAXN 1000005
using namespace std;
vector<int> a(MAXN), ans(MAXN), f(MAXN), lake(MAXN);
int n, m;
int find(int x){
if(f[x] == x) return x;
return f[x] = find(f[x]);
}
bool solve(){
int x;
for(int i=1; i<=n; ++i) lake[i] = 0;
for(int i=1; i<=m; ++i){
if(a[i] == 0) continue;
x = find(lake[a[i]]);
if(x <= i){
ans[x] = a[i];
f[x] = find(x+1);
}
else return false;
lake[a[i]] = i;
}
printf("YES\n");
for(int i=1; i<=m; ++i) if(a[i] == 0) printf("%d ", ans[i]);
printf("\n");
return true;
}
int main(){
int kase;
cin >> kase;
while(kase--){
cin >> n >> m;
for(int i=1; i<=m; ++i){
cin >> a[i];
ans[i] = 0;
}
int last = m+1;
f[m+1] = m+1;
for(int i=m; i>=0; --i){
if(a[i] == 0 && i != 0) last = i;
f[i] = last;
}
if(!solve()) printf("NO\n");
}
return 0;
}
|
