【Codeforces Round #398 (Div. 2)】Codeforces 767A Snacktower
来源:互联网 发布:mysql 登录错误次数 编辑:程序博客网 时间:2024/06/08 02:57
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.
从大到小放,小的只能在最后一个大的放的那天放。
#include<cstdio>#include<vector>#include<algorithm>using namespace std;vector<int> f[100010];int a[100010],plc[100010];int main(){ int n,now=0; scanf("%d",&n); for (int i=1;i<=n;i++) scanf("%d",&a[i]),plc[a[i]]=i; for (int i=n;i;i--) { f[max(now,plc[i])].push_back(i); now=max(now,plc[i]); } for (int i=1;i<=n;i++) { for (int j=0;j<f[i].size();j++) { if (j) putchar(' '); printf("%d",f[i][j]); } putchar('\n'); }}
- 【Codeforces Round #398 (Div. 2)】Codeforces 767A Snacktower
- Codeforces Round #398 (Div. 2) A Snacktower
- Codeforces Round #398 (Div. 2) A. Snacktower 模拟
- Codeforces Round #398(Div. 2)A. Snacktower【模拟】
- Codeforces Round #398 A. Snacktower
- 【Codeforces 767 A. Snacktower】
- Codeforces 767A Snacktower
- CodeForces-767A Snacktower
- CodeForces 767A Snacktower
- Codeforces Round #398 (Div. 2) A.Snacktower B.The Queue C.Garland D.Cartons of milk E.Change-fr
- Cards(Codeforces 701A)(Codeforces Round #364Div.2 A)
- Codeforces Round #398 (Div. 2)
- 【Codeforces Round #398 (Div. 2)】Codeforces 767B The Queue
- 【Codeforces Round #398 (Div. 2)】Codeforces 767C Garland
- 【Codeforces Round #398 (Div. 2)】Codeforces 767E Change-free
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #174 (Div. 2) Problem A
- Codeforces Round #173 (Div. 2) A.Bit++
- Junit使用
- 动态表单的数据库结构设计的三种方案
- 用VB实现番茄工作法 miniTomato
- 操作系统的进程调度算法
- PAT 1077
- 【Codeforces Round #398 (Div. 2)】Codeforces 767A Snacktower
- oj1945: C语言实验——图形输出(字符常量练习)
- Linux的常用快捷键(上部分)
- qqimg
- Bootstrap 导航元素
- 带新手走进神秘的HTTP协议
- 特征提取
- uva 1152 和为0的4个值
- Hibernate criterion 方法总结