[42588] 탑

#include <iostream>
#include <vector>
using namespace std;
vector<int> solution(vector<int> heights)
{
	vector<int> answer;
	bool isReceive = false;
	for (int i = 0; i < heights.size(); i++)
	{
		isReceive = false;
		for (int j = i; j >= 0; j--)
		{
			if (heights[i] < heights[j])
			{
				answer.push_back(j + 1);
				isReceive = true;
				break;
			}
		}
		if (!isReceive)
			answer.push_back(0);
	}
	return answer;
}