CodeForces-767A Snacktower

最新推荐文章于 2018-11-19 17:47:07 发布

VIP文章 Evelyn_y

最新推荐文章于 2018-11-19 17:47:07 发布

阅读量769

点赞数

分类专栏： ACM ACM水题文章标签： ACM

本文链接：https://blog.csdn.net/sinat_35282516/article/details/56296027

版权

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 e