@[_luo_gu](/user/950927)
这是我的AC代码，可以对一下
```cpp
#include <cstdio>
#include <stack>
using namespace std;
struct node {
int num, id, p;
} a[3000005];
stack<node> s;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i].num);
a[i].id = i;
while (s.size() && s.top().num < a[i].num) {
a[s.top().id].p = a[i].id;
s.pop();
}
s.push(a[i]);
}
for (int i = 1; i <= n; i++) {
printf("%d ", a[i].p);
}
return 0;
}
```
by Lian_lele @ 2023-08-18 21:53:08
@[Lian_lele](/user/923248) 感谢大佬
by _luo_gu @ 2023-08-19 07:50:29
@[_luo_gu](/user/950927) 不用谢~
by Lian_lele @ 2023-08-19 08:16:28