takeU

import sys input = sys.stdin.readline 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 n, m = int(input()), int(input()) board = [[0] * n for _ in range(n)] for _ in range(m): x, y = map(int, input().split()) board[x - 1][y - 1] = 1 check_board = [[0] * n for _ in range(n..

def get_prime(n): li = [0, 0] + [1] * n for i in range(2, n + 1): if li[i]: for j in range(2 * i, n + 1, i): li[j] = 0 return li 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 visited[g] = 1 return True return False n = int(input()) li = list(map(int, input().split())) prime = get_prime(2000) o..

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 n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(n)] row_board = [[0] * m for _ in range(n)] count = 0 for i in range(n): count += 1 check = 0 for j in range(m): if board[i][j] < 2: r..

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) 스택