Module: 优先队列：priority_queue


Problem

2 /3


最大支持

Problem

给定一个数字序列。对于每个数字，显示输入时的当前最大值。
 
输入
先给出N个数（数列的个数，1<=N<=100000），然后是 N个数。
 
输出
打印当前高点。
 
例子
<头> <正文>

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!

# 输入 输出
1
7
4 2 5 -1 4 6 2
 4
4
5
5
5
6
6