[20250920] BOJ / G4 / 롤러코스터 / 이강현 #936
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
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/12762
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N개의 기둥들이 있을때, 내려갔다 올라오는 구간의 길이가 최대가 되는 경우 그 길이를 출력.
🔍 풀이 방법
LIS
왼쪽에서 LDS, 오른쪽에서 LIS를 각각 하고 모든 지점에서 둘의 합이 최대가 되는 것을 구함.
⏳ 회고
좌 우에서 오는 거니까 투 포인터를 생각했는데, 풀어보니 LIS의 전형적인 풀이였다.
나는 바보다.