我的代码：

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;

    vector<int> sizes(n);
    for (int i = 0; i < n; i++)
    {
        cin >> sizes[i];
    }

    stack<int> tower;
    for (int i = 0; i < n; i++)
    {
        if (tower.empty() || sizes[i] < tower.top())
        {
            tower.push(sizes[i]);
        }
        else
        {
            stack<int> temp;
            while (!tower.empty() && sizes[i] > tower.top())
            {
                temp.push(tower.top());
                tower.pop();
            }
            tower.push(sizes[i]);
            while (!temp.empty())
            {
                tower.push(temp.top());
                temp.pop();
            }
        }

        while (!tower.empty())
        {
            cout << tower.top() << " ";
            tower.pop();
        }
        cout << endl;
    }

    return 0;
}