3 条题解

  • 0
    @ 2025-3-19 21:49:39
    #include <bits/stdc++.h>
    #define endl '\n'
    using namespace std;
    typedef pair<int,int> aII;  
    using ll = long long;
    using ULL = unsigned long long;
    const int N = 1e6+5;
    
    int n, a[N], q[N];
    int hh = 0, tt = -1;
    inline void solve() { 
        cin >> n;
        for (int i = 1; i <= n; i++) cin >> a[i];
        for(int i = 1;i <= n;i++) {
            while (hh <= tt && a[q[tt]] <= a[i]) --tt;
            q[++tt] = i;
        }
        for (int i = hh; i <= tt; i++) cout << a[q[i]] << ' '; 
    
    }
    int main() { 
        ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        int _ = 1; 
        //int _; cin >> _;
        while (_--) solve();
        return 0;
    }
    

    信息

    ID
    103
    时间
    1000ms
    内存
    256MiB
    难度
    6
    标签
    递交数
    190
    已通过
    54
    上传者