시나브로

#include #include using namespace std; vector solution(vector heights) { int box=heights.size(); vector answer(box, 0); vector list; for (int i = heights.size()-1; i >= 0; i--) { if (list.size() != 0) { while (1) { if (list.size() != 0) { if (heights[i] > heights[list.back()]) { answer[list.back()] = i + 1; list.pop_back(); } else break; } else break; } } list.push_back(i); } return answer; } ht..