Submission #1961115

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back 
#define pf push_front 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )
#define All(v) v.begin(), v.end()

typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;

signed main() {
  int n;
  int a[100010];
  int ans[100010] = {0};
  vector<Pii> b;

  cin >> n;
  Rep(i, n-1) {
    cin >> a[i];
    b.pb({a[i], i+1});
  }

  sort(All(b));

  Rep(i, b.size()) {
    int x = b[i].fr, y = b[i].sc;

    if ( ans[y-1] == 0 ) ans[y-1] = x;
    if ( ans[y] == 0 ) ans[y] = x;
  }

  Rep(i, n-1) {
    cout << ans[i] << " ";
  }

  cout << ans[n-1] << endl;
}

Submission Info

Judge Result