提交时间:2023-08-23 15:34:28

运行 ID: 99677

#include<bits/stdc++.h> #define int long long using namespace std; namespace Fast{ inline int fr(){ int x = 0,f = 1; char c = getchar(); while (c < '0' || c > '9'){ if (c == '-'){ f = -1; } c = getchar(); } while (c >= '0' && c <= '9'){ x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } return x * f; } inline void fw(int x){ if (x < 0){ x = -x; putchar('-'); } if (x > 9){ fw(x / 10); } putchar(x % 10 + 48); } } using namespace Fast; int a[114514],n; bool f[114514]; void dfs(int x){ if (f[x]){ return ; } f[x] = true; cout<<a[x]<<" "; vector <int> vec1,vec2; for (int i = x + 1;i <= n;i++){ if (a[i] < a[x]){ vec1.push_back(i); } } for (int i = 0;i < vec1.size();i++){ dfs(vec1[i]); } for (int i = x + 1;i <= n;i++){ if (a[i] >= a[x]){ vec2.push_back(i); } } for (int i = 0;i < vec1.size();i++){ dfs(vec2[i]); } } signed main(){ n = fr(); for (int i = 1;i <= n;i++){ a[i] = fr(); } dfs(1); return 0; }