2. 25

• https://www.acmicpc.net/problem/11002를 풀기 위한 재료들을 모으고 있다.
• 1. finding upper tangent between two convex polygons in logarithmic complexity
• 2. linked range sequence that allows random access
• Dynamic Convex hull이라는 data structure가 있더라. Jacob(2002)