单调栈存下表
```language
#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, a[N], stk[N], tt, ans[N];
int main(){
    cin >>n;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = n; i >= 1; i--){
		while(tt && a[i] >= a[stk[tt]]) {
            tt--;
        }
		if(tt) ans[i] = stk[tt];
	    else ans [i] = 0;
        stk[++tt] = i;
    }
	for(int i = 1; i <= n; i++){
        cout << ans[i] << endl;
    }  
	return 0;
}