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/22945
🧭 풀이 시간
10분
👀 체감 난이도
✏️ 문제 설명
개발자 N명이 일렬로 서있고, 각 개발자는 능력치를 가진다.
두 개발자가 함께 팀을 만들 수 있고, 팀의 능력치는
(두 개발자 사이에 존재하는 다른 개발자 수) * (두 개발자의 능력치 중 최솟값)이 된다.팀 능력치의 최댓값을 구해보자.
🔍 풀이 방법
개발자는 10만명 주어지지만 능력치의 가짓수는 10000개 뿐이다.
각 능력치별로 최소 인덱스와 최대 인덱스를 저장해두고, 10000 * 10000 이중 for문으로 최댓값을 찾아줬다.
⏳ 회고
흠