takeU

n, m = map(int, input().split()) board = [list(input()) for _ in range(n)] visited = [[0] * m for _ in range(n)] d = { 'L': [0, -1], 'R': [0, 1], 'U': [-1, 0], 'D': [1, 0] } count, ans = 0, 0 def dfs(x, y, c): global ans if visited[x][y]: if visited[x][y] == c: ans += 1 return visited[x][y] = c nx, ny = x + d[board[x][y]][0], y + d[board[x][y]][1] dfs(nx, ny, c) for i in range(n): for j in range..

a, b = ' ' + input(), ' ' + input() dp = [[''] * len(b) for _ in range(len(a))] for i in range(1, len(a)): for j in range(1, len(b)): if a[i] == b[j]: dp[i][j] = dp[i - 1][j - 1] + a[i] else: if len(dp[i - 1][j]) >= len(dp[i][j - 1]): dp[i][j] = dp[i - 1][j] else: dp[i][j] = dp[i][j - 1] print(len(dp[-1][-1])) print(dp[-1][-1]) dp, LCS

import sys input = sys.stdin.readline from itertools import combinations n = int(input()) parent = list(range(n + 1)) def find_parent(parent, x): if parent[x] != x: parent[x] = find_parent(parent, parent[x]) return parent[x] def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: parent[a] = b v = [] total_cost = 0 for i in range(1, n +..

import sys input = sys.stdin.readline v, e = map(int, input().split()) parent = list(range(v + 1)) def find_parent(parent, x): if parent[x] != x: parent[x] = find_parent(parent, parent[x]) return parent[x] def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: parent[a] = b edges = [] total_cost = 0 for _ in range(e): a, b, cost = map(..

n, m = map(int, input().split()) def count(n, k): count = 0 while n: n //= k count += n return count five = count(n, 5) - count(m, 5) - count(n - m, 5) two = count(n, 2) - count(m, 2) - count(n - m, 2) print(min(five, two))

import sys input = sys.stdin.readline from bisect import bisect_left n = int(input()) li = sorted([list(map(int, input().split())) for _ in range(n)]) dp, idx, ans = [], [], [] for l in li: cur = bisect_left(dp, l[1]) if len(dp) != cur: dp[cur] = l[1] else: dp.append(l[1]) idx.append(cur + 1) m = len(dp) print(len(li) - m) for i in range(len(idx) - 1, -1, -1): if idx[i] == m: m -= 1 else: ans.ap..

n, k = map(int, input().split()) li = list(map(int, input().split())) dp = [sum(li[:k])] for i in range(k, n): dp.append(dp[i - k] - li[i - k] + li[i]) print(max(dp)) 누적 합

from bisect import bisect_left n = int(input()) li = list(map(int, input().split())) dp, idx, ans = [], [], [] for l in li: cur = bisect_left(dp, l) if len(dp)

from bisect import bisect_left n = int(input()) li = list(map(int, input().split())) dp = [] for l in li: cur = bisect_left(dp, l) if len(dp)

from bisect import bisect_left n = int(input()) li = sorted([list(map(int, input().split())) for _ in range(n)]) li = list(map(lambda x: x[1], li)) dp = [] for l in li: cur = bisect_left(dp, l) if len(dp)