Submission #616060

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 100010;
int K[MAXN], ans[MAXN];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    for (int i = 0; i < N-1; i++) cin >> K[i];
    ans[0] = K[0], ans[N-1] = K[N-2];
    for (int i = 1; i < N-1; i++) ans[i] = min(K[i-1], K[i]);
    for (int i = 0; i < N; i++) {
        cout << ans[i];
        if (i < N-1) cout << " ";
    }
    cout << endl;
    return 0;
}

Submission Info

Judge Result