Triangle#1041
Given points on a plane, you must find the triangle with the largest area, where the vertices are some three of the given points.
The input consists of several test cases. The first line of each test case contains an integer , indicating the number of points on the plane. Each of the next lines contains two integers x_i and y_i, the coordinates of a point. The last line of the input contains , indicating the end of input. This line should not be processed. It is guaranteed that 1 \le n \le 50000 and -10^4 \le x_i, y_i \le 10^4 for all i = 1, \ldots, n.
For each test case, print the value of the largest triangle's area, with exactly two digits after the decimal point. It is guaranteed that a non-negative answer always exists.
Örnek 1