栈和排序_

如果当前数是后面数最大的数，那么我们就弹出，否则加入。

对于弹出后，如果当前栈顶还是比后面的最大的数大那么我们就继续弹出

经典操作维护后缀最大值,从后面往前维护

// Problem: 栈和排序
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/22669/A
// Memory Limit: 262144 MB
// Time Limit: 2000 ms
// 2022-05-31 15:35:48
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);
inline ll ksc(ll x,ll y,ll mod)
{
    ll ans = 0;
    while (y) {
        if (y & 1)
            ans = (ans + x) %mod;
        y >>= 1;
        x = (x + x) %mod;
    }
    return ans;
}
inline ll qmi (ll a, ll b) {
    ll ans = 1;
    while (b) {
        if (b & 1) ans = ans * a;
        a = a * a;
        b >>= 1;
    }
    return ans;
}
inline int read () {
    int x = 0, f = 0;
    char ch = getchar();
    while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
    while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
    return f?-x:x;
}
template<typename T> void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x >= 10) print(x/10);
    putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
    return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
    return (a + b) %mod;
}
// inline ll inv (ll a) {
    // return qmi(a, mod - 2);
// }
void solve() {
    int n;
    cin >> n;
    stack<int> q;
    vector<int> a(n + 1, 0), p(n + 1, 0);
    for (int i = 0; i < n; i ++) {
        cin >> a[i];
    }
    for (int i = n - 1; i >= 0; i --) {
        p[i] = max (p[i + 1], a[i]);
    }
    for (int i = 0; i < n; i ++) {
        q.push(a[i]);
        if (q.top() == p[i]) {
            cout << q.top() << ' ';
            q.pop();
            while(q.size() && q.top() > p[i + 1]) {
                cout << q.top() << " ";
                q.pop();
            }
        }
    }
    while(q.size()) {
        cout << q.top() << ' ';
        q.pop();
    }
}
int main () {
    // ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}