【題解】Codeforces EDU Course-2 Lesson-7-2 B. Parking

#include <iostream>
using namespace std;
 
int n, m, p[1000005];
 
int pa(int x){
    if (x == p[x]) return x;
    return p[x] = pa(p[x]);
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n+1; i++){
        p[i] = i;
    }
    for (int i = 0, x; i < n; i++){
        cin >> x;
        if (pa(x) == n+1){
            cout << pa(1) << " ";
            p[pa(1)] = pa(pa(1)+1);
        }
        else{
            cout << pa(x) << " ";
            p[pa(x)] = pa(pa(x)+1);
        }
    }
}