[20250829] BOJ / G5 / 생일선물 / 이강현 #771
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/12892
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
가격 차이가 D만큼 나지 않도록 하는 선물 만족도의 합을 구하는 문제
🔍 풀이 방법
투 포인터, 슬라이딩 윈도우
포인터 두개 두고 같은 방향으로 밀면서 합을 관리.
⏳ 회고
진짜 쉬운 문젠데 괜히 큰 숫자를 보고 이분 탐색에 꽂혀가지고 이상하게 생각했다.