60分，求调

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAXN 1000000
stack<ll>q;
ll n,a[MAXN],f[MAXN];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	f[n]=0;
	q.push(n); 
	for(int i=n-1;i>=1;i--){
		while(!q.empty()&&a[q.top()]<=a[i])
			q.pop();
		if(q.size()==0)
			f[i]=0;
		else 
			f[i]=q.top();
		q.push(i);
	}
	for(int i=1;i<=n;i++)
		cout<<f[i]<<" ";
	return 0;
}