Submission #3452568

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = ((B)-1); I >= (A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;
#define pri(a) cout << (a) << endl


int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll N,maxK=0;
	cin >> N;
	vector<ll> K(N-1);
	FOR(i,0,N-1)cin>>K[i];
	FOR(i,0,N-1)maxK=max(K[i],maxK);
	vector<ll> ans(N,maxK);
	ans[0] = K[0];
	FOR(i,1,N){
		if(K[i-1]<K[i]){
			ans[i] = K[i-1];
		}else if(K[i-1]>K[i]){
			if(K[i-1]>ans[i-1]){
				ans[i] = K[i-1]; 
			}else{
				ans[i] = K[i];
			}
		}else{
			ans[i] = K[i];
		}
	}
	FOR(i,0,N){
		cout << ans[i] << " ";
	}
	cout << endl;
}

Submission Info

Judge Result