Merge remote-tracking branch 'upstream/main'

Author: gmlrude

live12/test121/문제2/백한결.py

@@ -8,6 +8,26 @@ def main():
 
     result = 0
 
+    for i in range(N):
+        visible = 0
+
+        minSlope = float('inf')
+        for j in range(i-1, -1, -1):
+            slope = (heights[i] - heights[j]) / (i - j)
+            if slope < minSlope:
+                minSlope = slope
+                visible += 1
+
+        maxSlope = -float('inf')
+        for j in range(i+1, N):
+            slope = (heights[j] - heights[i]) / (j - i)
+            if slope > maxSlope:
+                maxSlope = slope
+                visible += 1
+
+        result = max(result, visible)
+
+    print(result)
 
 if __name__ == '__main__':
     main()

live12/test122/문제1/백한결.py

@@ -0,0 +1,29 @@
+import sys
+
+def main():
+    input = sys.stdin.readline
+
+    N = int(input())
+    K = int(input())
+
+    sensors = list(map(int, input().split()))
+
+    if K >= N:
+        print(0)
+        return
+
+    sensors.sort()
+
+    diffs = []
+    for i in range(N-1):
+        diff = sensors[i+1] - sensors[i]
+        diffs.append(diff)
+
+    diffs.sort(reverse=True)
+
+    result = sum(diffs[K-1:])
+
+    print(result)
+
+if __name__ == '__main__':
+    main()

live12/test122/문제2/백한결.py

@@ -0,0 +1,24 @@
+import sys
+
+def main():
+    input = sys.stdin.readline
+
+    N, M = map(int, input().split())
+    A = [list(map(int, input().split())) for _ in range(N)]
+
+    S = [[0] * (M+1) for _ in range(N+1)]
+
+    for i in range(1, N+1):
+        for j in range(1, M+1):
+            S[i][j] = A[i-1][j-1] + S[i-1][j] + S[i][j-1] - S[i-1][j-1]
+
+    K = int(input())
+
+    for _ in range(K):
+        x1, y1, x2, y2 = map(int, input().split())
+        result = (S[x2][y2] - S[x1-1][y2] - S[x2][y1-1] + S[x1-1][y1-1])
+
+        print(result)
+
+if __name__ == '__main__':
+    main()