63-9kyo-hwang

AlgoLeadMe · Sep 3, 2024 · abe7706 · abe7706
1 parent f754cc5
commit abe7706
Show file tree

Hide file tree

Showing 2 changed files with 61 additions and 1 deletion.
diff --git a/9-kyo-hwang/Binary Search/13397 구간 나누기 2.cpp b/9-kyo-hwang/Binary Search/13397 구간 나누기 2.cpp
@@ -0,0 +1,59 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main()
+{
+    cin.tie(nullptr)->sync_with_stdio(false);
+
+    int N, M; cin >> N >> M;
+
+    vector<int> Nums(N);
+    for(int& Num : Nums)
+    {
+        cin >> Num;
+    }
+
+    auto IsValid = [&](int EstimateScore)
+    {
+        int Count = 1;
+        int Min = Nums[0], Max = Nums[0];
+
+        for(int i = 1; i < N; ++i)
+        {
+            Min = min(Min, Nums[i]);
+            Max = max(Max, Nums[i]);
+
+            if(Max - Min > EstimateScore)
+            {
+                Count++;
+                Min = Nums[i];
+                Max = Nums[i];
+            }
+        }
+
+        return Count <= M;
+    };
+
+    int Min = 0, Max = *max_element(Nums.begin(), Nums.end());
+    int Score = Max;
+    while(Min <= Max)
+    {
+        int EstimateScore = (Min + Max) / 2;
+        if(IsValid(EstimateScore))
+        {
+            Score = min(Score, EstimateScore);
+            Max = EstimateScore - 1;
+        }
+        else
+        {
+            Min = EstimateScore + 1;
+        }
+    }
+
+    cout << Score;
+
+    return 0;
+}
diff --git a/9-kyo-hwang/README.md b/9-kyo-hwang/README.md
@@ -62,4 +62,5 @@
 | 59차시 | 2024.8.01  | Greedy                     | [마법의 엘리베이터](https://school.programmers.co.kr/learn/courses/30/lessons/148653)   | [#210](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/210) |
 | 60차시 | 2024.8.05  | Implementation             | [과제 진행하기](https://school.programmers.co.kr/learn/courses/30/lessons/176962)   | [#213](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/213) |
 | 61차시 | 2024.8.08  | Implementation             | [테이블 해시 함수](https://school.programmers.co.kr/learn/courses/30/lessons/147354)   | [#214](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/214) |
-| 62차시 | 2024.8.12  | Graph Traversal            | [무인도 여행](https://school.programmers.co.kr/learn/courses/30/lessons/154540)   | [#217](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/217) |
+| 62차시 | 2024.8.12  | Graph Traversal            | [무인도 여행](https://school.programmers.co.kr/learn/courses/30/lessons/154540)   | [#217](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/217) |
+| 63차시 | 2024.9.3   | Binary Search              | [구간 나누기2](https://www.acmicpc.net/problem/13397)   | [#218](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/218) |