|
||||||||||
Summer holidayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2493 Accepted Submission(s): 861 Problem Description Summer holiday was coming! Xiaomao went back to his hometown where he yearn day and night, his hometown has picturesque scenery. There is a big forest beside his village. There are n trees in the forest. Now they want to across the forest with a rope (the rope won't cross). Try to find 3 trees in this tree on the rope which can make the area of the surrounded largest. Work out the area of it. Input The input will consist of several test cases. The first line contains a positive integer N£¨3<=N<=10^6£©, the number of trees, followed N lines, each gives the (xi, yi ) coordinates. Output Print the largest area, one number a line with two decimal places. Sample Input
Sample Output
Source | ||||||||||
|