킹솔이

n = int(input()) for _ in range(n): m = int(input()) li = list(map(int, input().split())) li.sort() result = 0 for i in range(2, m): temp = li[i]-li[i-2] result = max(temp,result) print(result)

import sys from collections import deque n, m, v = map(int, input().split()) graph = [] for i in range(n+1): graph.append([]) for i in range(m): x, y = map(int, sys.stdin.readline().split()) graph[x].append(y) graph[y].append(x) for i in range(n+1): graph[i].sort() visited = [False for i in range(n+1)] def dfs(x): visited[x] = True print(x, end=" ") for i in graph[x]: if not visited[i]: dfs(i) d..

from _collections import deque f, s, g, u, d= map(int, input().split()) visited = [0 for _ in range(f+1)] def bfs(): que = deque() que.append(s) visited[s] = 1 while que: floor = que.popleft() if floor==g: return visited[g]-1 #up if floor+u = 1 and not visited[floor-d]: que.append(floor-d) visited[floor-d] = visited[floor]+1 return "use the stairs" print(bfs()) BFS를 이용하면 된다. queue는 멀티스레드용 모듈이라 매..