Submission #615863

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
	ll n;
	cin >> n;
	vector<ll> v(n);
	for(int i=0;i<n-1;i++)
		cin >> v[i];
	cout << v[0] << " ";
	for(int i=0;i<n-2;i++){
		cout << max(v[i],v[i]+1) << " ";
	}
	cout << v[n-2] << endl;
	return 0;
}

Submission Info

Judge Result