Submission #616050

---

Source Code Expand

#include <iostream>
#include <vector>

using namespace std;

int main(void)
{
	int n;
	cin >> n;
	vector<int> k(n - 1);
	vector<int> ans(n);
	int max = 0;
	int keep = 0;
	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++) {
		if (k[i - 1] < k[i]) ans[i] = k[i - 1];
		else ans[i] = k[i];
	}
	for (int i = 0; i < n - 1; i++) {
		cout << ans[i] << " ";
	}
	cout << ans[n - 1] << endl;
	return 0;
}

Submission Info

Judge Result