Submission #616148

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <string>
#include <algorithm>
#include <climits>
#include <utility>

#define PRINT(STR) cout << STR << endl;
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define REG(i, a, b) for (int (i) = ((int)(a)); (i) < ((int)(b)); i++)
#define ALL(V) (V).begin(), (V).end()
#define SPACE " "

typedef long long ll;

using namespace std;

int nextInt() { int n = -1; cin >> n; return n; }
double nextDouble() { double d = -1; cin >> d; return d; }
ll nextll() { ll n = -1; cin >> n; return n; }
string nextString() { string str; cin >> str; return str; }

// BEGIN //////////////////////////////////////////////////////////////
int main() {
  int N = nextInt();
  ll K[100001];
  ll L[100003];
  REP(i, N - 1) {
    K[i] = nextll();
  }
  L[0] = 1;
  if (K[0] > K[1]) {
    L[0] = K[0];
  }
  L[N-1] = K[N-2];
  for (int i = 1; i < N - 1; i++) {
    if (L[i - 1] < K[i - 1]) {
      L[i] = K[i-1];
    } else {
      L[i] = 1;
    }
  }
  REP(i, N) {
    cout << L[i];
    if (i < N - 1) {
      cout << SPACE;
    }
  }
  cout << endl;

	return 0;
}
// END   //////////////////////////////////////////////////////////////

Submission Info

Judge Result