[20251125] BOJ / G5 / 공통 부분 문자열 / 이준희 #1511
Merged
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/5582
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
부분 문자열이랑 한 문자열에서 연속되게 나타나는 문자열입니다.
두 문자열의 공통 부분 문자열 중 가장 긴 것의 길이를 구하는 문제입니다.
🔍 풀이 방법
2차원 DP를 이용해서 풀었습니다.
두 문자열을 싹 돌면서 연속된 부분이 겹치는 부분을 찾았습니다.
⏳ 회고
문제를 이해하는게 어려웠습니다. 독해력이 요즘 떨어지고 있습니다.