[20250705] BOJ / G4 / 고냥이 / 김수연 #418
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/16472
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
인식할 수 있는 알파벳의 최대 개수 N이 주어지고, 문자열이 주어질 때
인식할 수 있는 문자열의 최대길이 구하기
🔍 풀이 방법
이분탐색 이용해서 cnt가 N이하로 유지되도록 start와 end 값 변경해가면서 구함
⏳ 회고
ez