#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int stk[N],tt;
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i ++){
int x;
cin >>x;
while(tt && stk[tt] >= x) tt --;
if (tt) cout << stk[tt] <<" ";
else cout << -1 << " ";
stk[++ tt] = x;
}
}
acwing 830 单调栈
最新推荐文章于 2024-06-17 21:54:57 发布