codeforces 767a

更好的阅读体验

According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time n snacks of distinct sizes will fall on the city, and the residents should build a Snacktower of them by placing snacks one on another. Of course, big snacks should be at the bottom of the tower, while small snacks should be at the top.

Years passed, and once different snacks started to fall onto the city, and the residents began to build the Snacktower.

However, they faced some troubles. Each day exactly one snack fell onto the city, but their order was strange. So, at some days the residents weren't able to put the new stack on the top of the Snacktower: they had to wait until all the bigger snacks fell. Of course, in order to not to anger miss Fortune again, the residents placed each snack on the top of the tower immediately as they could do it.

Write a program that models the behavior of Ankh-Morpork residents.

Input

The first line contains single integer n (1 ≤ n ≤ 100 000) — the total number of snacks.

The second line contains n integers, the i-th of them equals the size of the snack which fell on the i-th day. Sizes are distinct integers from 1 to n.

Output

Print n lines. On the i-th of them print the sizes of the snacks which the residents placed on the top of the Snacktower on the i-th day in the order they will do that. If no snack is placed on some day, leave the corresponding line empty.

Example
Input

3
3 1 2

Output

3
 
2 1

Input

5
4 5 1 2 3

Output

 
5 4
 
 
3 2 1

Note

In the example a snack of size 3 fell on the first day, and the residents immediately placed it. On the second day a snack of size 1 fell, and the residents weren't able to place it because they were missing the snack of size 2. On the third day a snack of size 2 fell, and the residents immediately placed it. Right after that they placed the snack of size 1 which had fallen before.

【题目大意】就是说给你一些无序蛋糕，每天读进来一个数，如果比之前的数字大那么就叠起来，输出一个回车，否则就逆序输出。

【分析】可以用栈来做，这是我最初的想法，但是如果某一天没有输出的数字的话就应该输出一个回车，这个也很好处理就是一个判断的事，但是后来发现初始数字和收尾数字不好弄，没办法只有拆开做，增加了代码量，后来看了看大神做的题解才恍然大悟，先贴上代码。

#include <bits/stdc++.h>
using namespace std;
int a[100005];
bool b[100005];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        int x=n;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            b[a[i]]=true;
            for(;b[x];x--)
                printf("%d ",x);
            printf("\n");
        }
    }
    return 0;
}

只能说做法很巧，因为输出的第一个数字一定是n，也就是最大的那个，每次都是，所以把数据存储起来，每读入一个就把他赋为真，然后输出的时候就判断最后一个是不是真的，如果为真，那么就可以输出了，否则就只输出一个回车。每一个数字之后都有一个空格，所以处理起来比较简单，不用考虑是不是最后一个数字。