신우섭의 도서관

// 2020-05-20 wsshin #include #include #include #include #include using namespace std; void Solution(int SizeY, int SizeX, int& AreaMax, int& FeatureCnt, vector vecBoard); int main() { int Y = 0; int X = 0; cin >> Y >> X; vector vecBoard; for (int i = 0; i > nInput; nTemp.push_back(nInput); } vecBoard.push_back(nTemp); ..

풀이 #include #include #include #include #include #include #include using namespace std; int solution(vector board, vector moves) { int answer = 0; stack stack; for (int move : moves) { for (int i = 0; i < board[move - 1].size(); i++) { if (board[i][move - 1] != 0) { if (stack.empty()) { stack.push(board[i][move - 1]); } else { if (stack.top() == board[i][move - 1]) { stack.pop(); answer+=2; } els..