Submission #1438243

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;

signed main(){
    int n;
    cin >> n;
    vector<int> pi(n), p(n), a(n), b(n);
    rep(i, 0, n) cin >> pi[i];
    rep(i, 0, n){
        p[pi[i] - 1] = i;
    }
    a[0] = 1;
    b[n - 1] = 1;
    rep(i, 1, n){
        if(p[i] - p[i - 1] > 0){
            a[i] = a[i - 1] + 2 * (p[i] - p[i - 1]);
        }else{
            a[i] = a[i - 1] + 1;
        }
    }
    repb(i, n - 2, 0){
        if(p[i + 1] < p[i]){
            b[i] = b[i + 1] + 2 * (p[i] - p[i + 1]);
        }else{
            b[i] = b[i + 1] + 1;
        }
    }
    rep(i, 0, n){
        cout << a[i];
        if(i != n - 1) cout << " ";
    }
    cout << endl;
    rep(i, 0, n){
        cout << b[i];
        if(i != n - 1) cout << " ";
    }
    cout << endl;
}

Submission Info

Judge Result