takeU

import sys input = sys.stdin.readline def find_parent(x): if parent[x] != x: return find_parent(parent[x]) return x def union_parent(a, b): a = find_parent(a) b = find_parent(b) if a != b: parent[max(a, b)] = min(a, b) edge_count[min(a, b)] = edge_count.get(min(a, b), 0) + 1 i = 1 while True: n, m = map(int, input().split()) if not n + m: break parent = list(range(n)) node_count, edge_count = {}..

from collections import deque n, k = int(input()), int(input()) board = [[0] * n for _ in range(n)] for _ in range(k): x, y = map(int, input().split()) board[x - 1][y - 1] = 1 dx, dy = [0, 1, 0, -1], [1, 0, -1, 0] d, time = 0, 1 snake = deque([[0, 0]]) x, y = 0, 0 l = int(input()) rule = deque([input().split() for _ in range(l)]) while True: x, y = x + dx[d], y + dy[d] if [x, y] in snake or x in..

import sys input = sys.stdin.readline n, m = map(int, input().split()) graph = [list(map(int, input().split()))[1:] for _ in range(n)] selected = [-1] * (m + 1) def bimatch(num): if visited[num]: return False visited[num] = 1 for g in graph[num]: if selected[g] == -1 or bimatch(selected[g]): selected[g] = num return True return False for _ in range(2): for i in range(n): visited = [0] * n bimatc..

import sys input = sys.stdin.readline n, m = map(int, input().split()) graph = [list(map(int, input().split()))[1:] for _ in range(n)] selected = [-1] * (m + 1) def bimatch(num): if visited[num]: return False visited[num] = 1 for g in graph[num]: if selected[g] == -1 or bimatch(selected[g]): selected[g] = num print(selected) return True return False for i in range(n): visited = [0] * n bimatch(i..

import sys input = sys.stdin.readline n = int(input()) li = [] for i in range(n): li.append([int(input()), i]) sorted_li = sorted(li) ans = 0 for i in range(n): ans = max(ans, sorted_li[i][1] - li[i][1]) print(ans + 1) 정렬

n = int(input()) li = list(map(int, input().split())) ans, stack = [-1] * n, [] count = {0: 0} for l in li: if l in count: count[l] += 1 else: count[l] = 1 stack.append(0) for i in range(1, n): while stack and count[li[stack[-1]]] < count[li[i]]: ans[stack.pop()] = li[i] stack.append(i) print(*ans) 스택

import sys input = sys.stdin.readline def interval_sum(start, end, index, left, right): if left > end or right end: return tree[index] += ..

https://www.youtube.com/watch?v=Y7C8qIpo7Dg https://www.youtube.com/watch?v=Sc7cbShMS3U https://www.youtube.com/watch?v=zZdT7bpzlig https://www.youtube.com/watch?v=H-9co9kMS2o https://www.youtube.com/watch?v=9voN0gkdlS4 https://www.youtube.com/watch?v=vd3IlOjSUGQ https://www.youtube.com/watch?v=7HgJIAUtICU https://www.youtube.com/watch?v=F1QF4wOQhjE 댓노추 (댓글에 노래 추천좀이라는뜻)

n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(n)] prefix_sum = [[0] * (m + 1) for _ in range(n + 1)] for i in range(1, n + 1): for j in range(1, m + 1): prefix_sum[i][j] = prefix_sum[i - 1][j] + prefix_sum[i][j - 1] + \ board[i - 1][j - 1] - prefix_sum[i - 1][j - 1] def acc(mat, x1, y1, x2, y2): return mat[x2][y2] - mat[x1 - 1][y2] - mat[x2][y1 - 1] + m..

from heapq import heappop, heappush import sys input = sys.stdin.readline n, m = map(int, input().split()) indegree = [0] * (n + 1) graph = [[] for _ in range(n + 1)] for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) indegree[b] += 1 def topological_sort(): ans = [] h = [] for i in range(1, n + 1): if indegree[i] == 0: heappush(h, i) while h: cur = heappop(h) ans.append(cur)..