8306 Еникеев Дмитрий

binary-search-for-the-answer/main.py

@@ -0,0 +1,31 @@
+def check(x, k, arr):
+    dots = 1
+    right_dot = arr[0]
+    for it in arr:
+        if it - right_dot >= x:
+            dots += 1
+            right_dot = it
+    if dots >= k:
+        return True
+    else:
+        return False
+
+
+if __name__ == '__main__':
+    n = int(input())
+    k = int(input()) + 1
+    array = []
+    for _ in range(n):
+        array.append(int(input()))
+    left = 0
+    right = array[-1] - array[0]
+    if not check(right, k, array):
+        while right - left > 1:
+            mid = (left + right) // 2
+            if check(mid, k, array):
+                left = mid
+            else:
+                right = mid
+        print(left)
+    else:
+        print(right)

binary-search-tree/1.contains.out

@@ -0,0 +1,6 @@
+-
+-
++
+-
++
+-

binary-search-tree/1.in

@@ -0,0 +1,7 @@
+6
+417
+274
+417
+53
+274
+89

binary-search-tree/1.min-after.out

@@ -0,0 +1,6 @@
+- -
+- 417
++ -
+- 274
++ 417
+- 274

binary-search-tree/2.contains.out

@@ -0,0 +1,20 @@
+-
+-
+-
+-
+-
+-
++
+-
+-
+-
++
+-
++
+-
+-
+-
+-
+-
++
+-

binary-search-tree/2.in

@@ -0,0 +1,21 @@
+20
+1223
+1855
+893
+1584
+918
+1499
+918
+143
+1799
+646
+1223
+179
+1584
+335
+208
+3
+773
+502
+773
+13

binary-search-tree/2.min-after.out

@@ -0,0 +1,20 @@
+- -
+- -
+- 1223
+- 1855
+- 1223
+- 1584
++ 1223
+- 893
+- 1855
+- 893
++ 1499
+- 646
++ 1799
+- 646
+- 335
+- 143
+- 893
+- 646
++ 893
+- 143