Submission #616138

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <set>
#include <iterator>
#include <cmath>
#include <tuple>
#include <stack>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <limits>
#include <cassert>

using namespace std;
typedef long long ll;
 
typedef vector<ll> vi;
typedef vector<vi> vvi;
template<class T = int> constexpr T PINF(){ return std::numeric_limits<T>::max(); }
template<class T = int> constexpr T MINF(){ return std::numeric_limits<T>::lowest(); }

template<class T = int> inline bool within(T min_x, T x, T max_x){ return min_x<=x&&x<max_x; }

template<class T = int> T gcd(T a, T b){ return b ? gcd(b,a%b) : a; }
template<class T = int> T lcm(T a, T b){ return a / gcd(a,b) * b; }
template<class T = int> T lcm_safe(T a, T b){ T p = a/gcd(a,b); return (b <= PINF<T>()/p) ? p*b:0; } //オーバーフローするときゼロを返す

 
int main() {
	cin.tie(nullptr); ios::sync_with_stdio(false);
	//cout << fixed << setprecision(10);
	int n;
	cin >> n;
	n--;
	vector<int> k(n);
	for(int i = 0; i < n; ++i){
		cin >> k[i];
	}

	cout << k[0];
	for(int i = 0; i < n-1; ++i){
		cout << " " << min(k[i],k[i+1]);
	}
	cout << " " << k[n-1] << endl;


  return 0;
}

Submission Info

Judge Result