MTRIAREA - Maximum Triangle Area
Given n distinct points on a plane, your task is to ﬁnd the triangle that have the maximum area, whose vertices are from the given points.
The input consists of several test cases. The ﬁrst 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 ≤ n ≤ 50000 and −10^4 ≤ xi, yi ≤ 10^4 for all i = 1 . . . n.
Sample Input 3 3 4 2 6 2 7 5 2 6 3 9 2 0 8 0 6 5 -1
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.
Sample output 0.50 27.00
Don't use float, you'll get WA.
some more test case?
Yes, they seem to rule each other out. Well, strictly speaking 1 <= n <= 50000, doesn't require some n to be 1 or 2, but ranges shouldn't be that unnecessary invalid.
how can n < 3? "You may assume that 1 ≤ n ≤ 50000 " and "You may assume that there is always an answer which is greater than zero."
My algo is O(n) which I think should be right but not yet proofed.Last edit: 2009-04-15 15:01:38
O(n^2)(Of course, with many optimizations) CAN get Accepted!Last edit: 2009-03-26 03:01:49