Submission #616097

---

Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include<iostream>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <string.h>
#include <string>
#include <limits.h>
#include <algorithm>
#include <set>
#include <ctime>
#include <cmath>
using namespace std;
#define SZ(x) ((int)(x).size())
#define rep(i,a,n) for (int i=a; i<(int)n; i++)
#define per(i,n,a) for (int i=n; i>=a; i--)
#define hk push_back
#define pk pop_back
#define mp make_pair
#define PI 3.141592653589793
#define clr(a) memset(a, 0, sizeof(a))
#define clr1(a) memset(a, -1, sizeof(a))
typedef vector<int> VI;
typedef vector< pair<int, int> > VIP;
typedef vector< pair<int, pair<int, double> > > VIPP;
typedef vector<string> VS;
typedef vector <double> VD;
typedef vector <bool> VB;
typedef long long ll;
#define MAX_V 1000
const ll mod = 1000000007;
ll powmod(ll a, ll b) {
	ll res = 1; a %= mod; for (; b; b >>= 1){ if (b & 1)res = res*a%mod; a = a*a%mod; }return res;
}

int n;
VI a, a1, a2;

int main()
{
	cin >> n;
	a.resize(n - 1); a1.resize(n); a2.resize(n);
	rep(i, 0, n - 1) {
		cin >> a[i];
		a1[i + 1] = a[i];
		a2[i] = a[i];
	}
	a1[0] = a1[1];
	a2[n - 1] = a2[n - 2];

	bool ok = true;
	rep(i, 0, n - 1) {
		if (max(a1[i], a1[i + 1]) != a[i]) {
			ok = false; break;
		}
	}

	if (ok) {
		rep(i, 0, n) cout << a1[i] << " ";
		cout << endl;
	}
	else {
		rep(i, 0, n) cout << a2[i] << " ";
		cout << endl;
	}

	return 0;
}

Submission Info

Judge Result