Module: Barisan keutamaan: priority_queue


Problem

2 /3


Sokongan Maks

Problem

Diberi urutan nombor. Untuk setiap nombor, paparkan maksimum semasa pada masa ia dimasukkan.
 
Input
Nombor N (bilangan nombor dalam jujukan, 1<=N<=100000) diberikan dahulu, dan kemudian N nombor.
 
Output
Cetak tahap tertinggi semasa.
 
Contoh

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!

# Input Output
1
7
4 2 5 -1 4 6 2
 4
4
5
5
5
6
6