这道题目描述了一个关于Ankh-Morpork居民如何按照大小顺序构建Snacktower的故事。居民们每天收到一个不同大小的零食，必须按大小顺序从大到小堆叠。输入包含零食总数n和每天收到的零食大小，输出为每天堆叠的零食顺序。题目要求在所有比当前零食大的零食都出现后才能放置新的零食。解题关键在于跟踪已出现的零食并正确输出顺序。
time limit: per test2 seconds
memory limit: per test256 megabytes
input: standard input
output: standard output
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
最低0.47元/天 解锁文章
576
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
