Nearest_Smaller_Values.cpp

#include <iostream>
#include <vector>
#include <unistd.h>
#include <unistd.h>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstring>
#include <sstream>
#include <set>
#include <unordered_set>
#include <cstring>
#include <string.h>
#include <queue>
#include <stack>

using namespace std;
#define mid(s, e) (s + (e - s) / 2)
#define ALL(x) (x).begin(), (x).end()
#define endl '\n'
#define MAXE(vec) *max_element(ALL(vec))
#define MINE(vec) *min_element(ALL(vec))
#define valid(a, b, c) (a >= b && a < c ? 1 : 0)
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define ll long long
void solve()
{
	ll n, nb;
	cin >> n;
	stack<int> s;
	map<ll, ll> index;
	for (int i = 0; i < n; i++)
	{
		cin >> nb;
		while (!s.empty() && s.top() >= nb)
		{
			s.pop();
		}
		if (s.empty())
			cout << 0 << " ";
		else
			cout << index[s.top()] << " ";
		s.push(nb);
		index[nb] = i + 1;
	}
}
int main(void)
{
	ll t;
	t = 1;
	while (t--)
		solve();
}