Submission #1961063

---

Source Code Expand

#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define PB push_back

const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int k[100010], dp[100010];
signed main(void)
{
  int n;
  cin >> n;
  REP(i, n-1) cin >> k[i];

  dp[0] = k[0], dp[n-1] = k[n-2];
  REP(i, n-2) {
    if(k[i] < k[i+1]) {
      dp[i+1] = k[i];
    } else {
      dp[i+1] = k[i+1];
    }
  }

  REP(i, n) cout << dp[i] << (i==n-1 ? "\n" : " ");

  return 0;
}

Submission Info

Judge Result