import java.util.*;
public class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
Deque<Integer> deque = new ArrayDeque();
while(n -- > 0){
int cur = scan.nextInt();
//表示栈内有元素,并且栈顶元素大于等于当前值cur
while(!deque.isEmpty() && deque.peek() >= cur)
deque.pop();
if(deque.isEmpty()){
System.out.print("-1 ");
}else{
System.out.print(deque.peek() + " ");
}
deque.push(cur);
}
}
}
AcWing 830.单调栈(java)
最新推荐文章于 2024-05-05 23:32:03 发布