Submission #57960018

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const char nl = '\n';
const char sp = ' ';
const int inf = 0x3f3f3f3f;
const string OUT[2]{ "NO", "YES" };
const string out[2]{ "No", "Yes" };
#define all(a) a.begin(), a.end()
#define dbg(a) cerr << (#a) << " = " << a << nl
#define OK() cerr << "OK until line " << __LINE__ << nl
using ll = long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ifstream fin(".in");
ofstream fout(".out");

auto start_time = chrono::high_resolution_clock::now();

double amcbn() {
    auto end_time = chrono::high_resolution_clock::now();
    return chrono::duration<double>(end_time - start_time).count();
}

template<typename T>
int rand(T a, T b) { return uniform_int_distribution<T>(a, b)(rng); }

template<typename T1, typename T2>
bool ckmax(T1& a, T2 b) { return a < b ? a = b, true : false; }

template<typename T1, typename T2>
bool ckmin(T1& a, T2 b) { return a > b ? a = b, true : false; }

const int nmax = 2e5;
int n;
int a[nmax + 5];
int nge[nmax + 5];
int dp[nmax + 5];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    stack<int> st;
    fill_n(nge + 1, n, n + 1);
    for (int i = 1; i <= n; ++i) {
        while (st.size() && a[st.top()] <= a[i]) {
            nge[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
    for (int i = n; i >= 1; --i) {
        dp[i] = dp[nge[i]] + 1;
    }
    for (int i = 1; i <= n; ++i) {
        cout << dp[i + 1] << sp;
    }
}

Submission Info

Judge Result