There are N lights above a road along the X-axis. The i-th light has Xi as its X-coordinate, and it is hung Yi above the road. The i-th light illuminates a triangular area, which is an isosceles...

putput is listed below. i-th light Yi valid flight road Develop a C++ program that solve the above problem

Extracted text: There are N lights above a road along the X-axis. The i-th light has Xi as its X-coordinate, and it is hung Yi above the road. The i-th light illuminates a triangular area, which is an isosceles triangle and its bottom edge is on the X-axis. The half of the top angle of the triangle is Zi degrees. (See the below figure) You have an aircraft which can fly on a fixed height. Because of some unknown reasons, this aircraft can fly only under the light. Your task is to find the maximum possible height for your flight from X=L to X=R. The lights do not block the aircraft, e.g., the aircraft can safely fly through a light. Develop a C++ program that solve the above problem, sample input output is listed below. i-th light Yi valid flight road Xi Develop a C++ program that solve the above problem. Input: 2 3.2 7.3 3.2 4.7 28 7.3 4.2 75 Output: 3.300759642