Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/16637
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
길이가 N인 수식에 괄호를 추가해서 최댓값을 구하는 문제
🔍 풀이 방법
DFS + 백트래킹으로 모든 경우의 수 탐색
각 연산자 위치에서 괄호를 넣을지 말지 선택하는 문제, 괄호를 넣으면 해당 연산을 먼저 계산하고, 안 넣으면 순차적으로 계산
⏳ 회고
그냥 DFS로 각 단계에서 괄호를 넣을지 말지만 결정하면 됨