takeU

n = int(input()) li = list(map(int, input().split())) left, right = 0, n - 1 ans = [2 * 10 ** 9 + 1, 0, 0] while left < right: l, r = li[left], li[right] if abs(l + r) < ans[0]: ans = [abs(l + r), l , r] if l + r == 0: break elif l + r < 0: left += 1 else: right -= 1 print(*ans[1:]) 투포인터

def power(c, n): if n == 1: return c elif n % 2: return multi(power(c, n - 1), c) else: return power(multi(c, c), n // 2) def multi(a,b): temp = [[0] * n for _ in range(n)] for i in range(n): for j in range(n): sum = 0 for k in range(n): sum += a[i][k] * b[k][j] temp[i][j] = sum % 1000 return temp n, b = map(int, input().split()) c = [list(map(int, input().split())) for _ in range(n)] ans = powe..

n = int(input()) board = [list(map(int, input().split())) for _ in range(n)] dp = [[[0] * 3 for _ in range(n)] for _ in range(n)] dp[0][1][0] = 1 for i in range(n): for j in range(1, n): if board[i][j - 1] != 1: dp[i][j][0] += dp[i][j - 1][0] if i > 0: dp[i][j][0] += dp[i][j - 1][2] if board[i - 1][j] != 1: dp[i][j][1] += dp[i - 1][j][1] if i > 0: dp[i][j][1] += dp[i - 1][j][2] if i > 0 and not ..

from collections import deque from itertools import combinations n, m = map(int, input().split()) board = [] zero, virus = [], [] dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] ans = 0 for i in range(n): cur = list(map(int, input().split())) for j in range(m): if cur[j] == 0: zero.append([i, j]) elif cur[j] == 2: virus.append([i, j]) board.append(cur) def bfs(b, co): global ans for c in co: b[c[0]][c[1]]..

r, c = map(int, input().split()) board = [list(input()) for _ in range(r)] visited = [[0] * c for _ in range(r)] check = [0] * 26 dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] ans = 1 def dfs(x, y, count): global ans ans = max(ans, count) check[ord(board[x][y]) - 65] = 1 for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0

n = int(input()) li = sorted(list(map(int, input().split()))) m = int(input()) s = list(map(int, input().split())) def search(x, s, e): while s x: e = mid - 1 else: s = mid + 1 return 0 print(*list(map(lambda x: search(x, 0, n - 1), s))) 이분탐색

r, c, t = list(map(int, input().split())) board = [] cleaner = [] dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] for i in range(r): cur = list(map(int, input().split())) for j in range(c): if cur[j] == -1: cleaner.append([i, j]) board.append(cur) def diffusion(b): res = [[0] * c for _ in range(r)] [x1, y1], [x2, y2] = cleaner res[x1][y1] = res[x2][y2] = -1 for x in range(r): for y in range(c): if b[x][y]..

n, m, r = map(int, input().split()) INF = int(1e9) item = [0] + list(map(int, input().split())) graph = [[0 if i == j else INF for i in range(n + 1)] for j in range(n + 1)] for _ in range(r): a, b, c = map(int, input().split()) graph[a][b] = graph[b][a] = c for k in range(1, n + 1): for a in range(1, n + 1): for b in range(1, n + 1): graph[a][b] = graph[b][a] = min(graph[a][b], graph[a][k] + gra..

import sys input = sys.stdin.readline n = int(input()) first = list(map(int, input().split())) dp1, dp2 = first[:], first[:] for _ in range(n - 1): cur = list(map(int, input().split())) temp00 = cur[0] + max(dp1[0], dp1[1]) temp10 = cur[0] + min(dp2[0], dp2[1]) temp01 = cur[1] + max(dp1[0], dp1[1], dp1[2]) temp11 = cur[1] + min(dp2[0], dp2[1], dp2[2]) temp02 = cur[2] + max(dp1[1], dp1[2]) temp12..

import heapq import sys input = sys.stdin.readline INF = int(1e9) n, m, x = map(int, input().split()) graph = [[] for i in range(n + 1)] for _ in range(m): a, b, c = map(int, input().split()) graph[a].append((b, c)) def dijkstra(start): q = [] heapq.heappush(q, (0, start)) distance[start] = 0 while q: dist, now = heapq.heappop(q) if distance[now] < dist: continue for i in graph[now]: cost = dist..