You are given n no. of lines in form of Ax + By = C, basically you are given A[i], b[i] and C[i] for line "i". Lines are given in a way such that 0 <= x[i] <= 1 and y[i] < y[i+1] for same X. Also, one point (x,y) is given too. Find out the two closest lines to the point such that the point is between them. Given: n - no. of lines a[i] b[i] c[i] - i th line. X Y - Point Output A[i] B[i] C[i] A[j] B[j] C[j] such that the point X,Y is between them.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
