BOJ_17266_굴다리 #51

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

SeoYoung99 wants to merge 1 commit into master from seoyoung

Contributor

SeoYoung99 commented Sep 3, 2023 •

edited

Loading

Problem Description

BOJ_17266_굴다리

n 길이의 굴다리에 m 개의 가로등을 놓아서 모든 길을 밝힐 수 있는 최소 높이의 가로등 높이 구하기 (단, 가로등은 높이만큼 양옆을 밝힌다)

Explain Process

처음에는 높이를 1부터 차례로 늘려가면서 전체를 비출 수 있는 높이를 구함.
while문 안에서 배열을 돌면서 비추는 곳이 충분한지 판단,, --> 시간초과 (당연함,,,,100000까지니까,,^^)
다인의 풀이를 듣고 생각을 바꿔서 각 가로등 사이의 간격과 맨 앞,뒤의 간격만 고려해서 최댓값을 찾음

Comment

땡큐 다인,,,,ㅎ


          BOJ_17266_굴다리

a7f31d6

SeoYoung99 requested review from Canihelpme, DevLuce, Yeeunbb, melli0505, mingzooo and soaringsso

September 3, 2023 08:28

SeoYoung99 self-assigned this

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

Canihelpme Awaiting requested review from Canihelpme

Yeeunbb Awaiting requested review from Yeeunbb

melli0505 Awaiting requested review from melli0505

DevLuce Awaiting requested review from DevLuce

mingzooo Awaiting requested review from mingzooo

soaringsso Awaiting requested review from soaringsso

Labels

None yet