PDF
備註:
詳解可以用 <!-- (content) --> <!-- (content) --> 註解起來
寫在答案的盡量精簡 可以直接寫在試卷上?
最好附上來源連結,用 1 ![]() 語法
@cliffxzx 可以標注作者
For two points $p$ and $q$ in the plane, we say that $p$ dominates $q$ if both $x$ and $y$ coordinates of $p$ are no less than that of $q$ respectively. Given a set $S$ of $n$ points, the rank of a point $p$ in $S$ is the number of points in $S$ dominated by $p$. We want to find the rank of every point in $S$. A naïve algorithm needs $O(n^2)$ time. Design a faster algorithm for this problem. @cliffxzx