2493번-탑

#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	stack<pair<int, int>> tower;
	cin >> n;
	tower.push({ 100000001,0 });
	for (int i = 1; i <= n; i++) {
		int height;
		cin >> height;
		while (tower.top().X < height)
			tower.pop();
		cout << tower.top().Y << ' ';
		tower.push({ height,i });
	}
}

pair를 알게된 좋은 문제ㅎㅎ