Submission #76406266

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

using ll = long long;
const ll MOD = 1e9 + 7;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    cin >> n;
    
    vector<pair<ll, ll>> a(n), x;
    for(int i = 0; i < n; ++i) {
        a[i].first = i;
        cin >> a[i].second;
    }
    
    vector<ll> ans(n, 0);
    for(int i = log2(n); i > 0; --i) {
        for(int j = 0; j < (1 << i); j += 2) {
            if(a[j].second < a[j + 1].second) {
                ans[a[j].first] = log2(n) - i + 1;
                x.push_back(a[j + 1]);
            }
            
            else {
                ans[a[j + 1].first] = log2(n) - i + 1;
                x.push_back(a[j]);
            }
        }
        
        a = x;
        x.clear();
    }
    
    for(auto it : ans)
    cout << it << " ";
    
    return 0;
}

Submission Info

Judge Result