Given a convex polygon with N vertices.
The vertices are set in counterclockwise traversal order.
Also, a set of K points is received at the input, and for each of them it is required to determine whether it lies inside this polygon or not.
The boundaries of the polygon are included.
The preprocessing of the polygon will be performed in O(N).
The running time of the algorithm is O(Klog n). The total operating time is O(N + KlogN).