CodeForces 767A Snacktower

简单模拟。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<ctime>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0);
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{
    char c = getchar();
    x = 0;
    while(!isdigit(c)) c = getchar();
    while(isdigit(c))
    {
        x = x * 10 + c - ‘0‘;
        c = getchar();
    }
}

int n,f[200010];

int main()
{
    cin>>n;
    int last=n;
    for(int i=1;i<=n;i++)
    {
        int x; cin>>x;
        f[x]=1;
        while(1)
        {
            if(f[last])
            {
                printf("%d ",last);
                last--;
            }
            else break;
        }
        printf("\n");
    }
    return 0;
}