{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"Given n distinct points on a plane, your task is to find the triangle that have the maximum area, whose vertices are from the given points."}},{"title":"Input","value":{"format":"HTML","content":"The input consists of several test cases. The first line of each test case contains an integer n, indicating the number of points on the plane. Each of the following n lines contains two integer xi and yi, indicating the ith points. The last line of the input is an integer −1, indicating the end of input, which should not be processed. You may assume that 1 \u0026lt;\u003d n \u0026lt;\u003d 50000 and −10\u003csup\u003e4\u003c/sup\u003e \u0026lt;\u003d xi, yi \u0026lt;\u003d 10\u003csup\u003e4\u003c/sup\u003e for all i \u003d 1 . . . n."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, print a line containing the maximum area, which contains two digits after the decimal point. You may assume that there is always an answer which is greater than zero."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\r\n3 4\r\n2 6\r\n2 7\r\n5\r\n2 6\r\n3 9\r\n2 0\r\n8 0\r\n6 5\r\n-1\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0.50\r\n27.00\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}