From a7f31d65b07adce26b33ff053e9ee3fc9061bd72 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=EC=A0=95=EC=84=9C=EC=98=81?= Date: Sun, 3 Sep 2023 17:16:58 +0900 Subject: [PATCH] =?UTF-8?q?BOJ=5F17266=5F=EA=B5=B4=EB=8B=A4=EB=A6=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...6_\352\265\264\353\213\244\353\246\254.py" | 45 +++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 "Seoyoung/BOJ_17266_\352\265\264\353\213\244\353\246\254.py" diff --git "a/Seoyoung/BOJ_17266_\352\265\264\353\213\244\353\246\254.py" "b/Seoyoung/BOJ_17266_\352\265\264\353\213\244\353\246\254.py" new file mode 100644 index 0000000..dbc50cf --- /dev/null +++ "b/Seoyoung/BOJ_17266_\352\265\264\353\213\244\353\246\254.py" @@ -0,0 +1,45 @@ +n = int(input()) +m = int(input()) +arr = list(map(int, input().split())) + +if m == 1: + print(max(arr[0], n-arr[0])) +else: + arr_gap = -1 + # 가로등 사이의 최대간격 + for i in range(1, m): + arr_gap = max(arr_gap, arr[i]-arr[i-1]) + if(arr_gap%2 == 0): + arr_gap = arr_gap//2 + else: + arr_gap = arr_gap//2 + 1 + # 가로등 맨 앞,뒤로의 최대간격 + gap = max(arr[0], n-arr[-1]) + # 둘 중 최댓값 출력 + print(max(arr_gap, gap)) + + +# 시간초과 코드;;; + +# add = 1 +# a = False +# result = 0 +# if m == 1: +# result = max(arr[0], n-arr[0]) +# else: +# while 1: +# for i in range(m-1): +# if(arr[i] - add) > 0: +# a = False +# break +# if(arr[i+1] - add > arr[i] + add): +# a = False +# break +# else: +# a = True +# continue +# if a == True: +# result = add +# break +# add += 1 +# print(result)