-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path767c.cpp
72 lines (62 loc) · 1.24 KB
/
767c.cpp
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
72
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using vpi = vector<pi>;
using vb = vector<bool>;
void solve() {
ll n;
cin >> n;
vi a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vi suf(n + 1);
vi in(n + 1);
ll mex = 0;
for (ll i = n - 1; i >= 0; i--) {
in[a[i]]++;
while(true) {
if (in[mex] == 0) break;
mex++;
}
suf[i] = mex;
}
vi b;
ll cur = 0;
ll cmex = 0;
stack<ll> upd;
vi freq(n + 1);
for (ll i = 0; i < n; i++) {
upd.push(a[i]);
freq[a[i]]++;
while (true) {
if (freq[cmex] == 0) break;
cmex++;
}
if(cmex >= suf[cur]) {
cur = i + 1;
while(!upd.empty()) {
ll top = upd.top();
freq[top]--;
upd.pop();
}
b.push_back(cmex);
cmex = 0;
}
}
cout << b.size() << endl;
for (ll i : b) {
cout << i << " ";
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin >> t;
while (t--) solve();
return 0;
}