This Problem was in a local programming contest that my school made. the problem says:
Given 2 points:
$(x_1,y_1)$ and $(x_2,y_2)$ (inside the polygon of course)
and a number $n$ and $n$ points which make up the convex polygon
what is the shortest path that joins these two points with the added constraint of having to go to the border of the given convex polygon?
Input and Output:
$3 \le$ $n$ $\le 5 \cdot 10^4$
$-10^9 \le x_i,y_i \le 10^9$
No 3 points are colinear
Print the length of the shortest path that satisfies the above constraints
NOTE: I couldn't solve the problem because I thought something was missing.. so please correct me if I was wrong. Thanks in advance :D