Submission #615924

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<pair<int, int> > p(n-1);
    for(int i=0; i<n-1; ++i){
        cin >> p[i].first;
        p[i].second = i;
    }

    sort(p.begin(), p.end());
    vector<int> ans(n, -1);
    for(int i=0; i<n-1; ++i){
        int j = p[i].second;
        if(ans[j] == -1)
            ans[j] = p[i].first;
        if(ans[j+1] == -1)
            ans[j+1] = p[i].first;
    }

    cout << ans[0];
    for(int i=1; i<n; ++i)
        cout << ' ' << ans[i];
    cout << endl;

    return 0;
}

Submission Info

Judge Result