알고리즘/ICPC (1) 썸네일형 리스트형 Apprentice Learning Trajectory 풀이(boj 19218, NERC 2019 A번) 문제 설명 https://www.acmicpc.net/problem/19218 19218번: Apprentice Learning Trajectory The first line contains integer $n$ ($1 \le n \le 200\,000$) --- the number of masters. Each of the next $n$ lines contains three integers $a_i, b_i, t_i$ ($1 \le a_i < a_i + t_i \le b_i \le 10^{18}$) --- the start and the end time of master's work, and th www.acmicpc.net n명의 master가 있고 각 master는 [a, b] 기간동안 sword.. 이전 1 다음
