摘要：
Given the Cartesian coordinates of n (> 0) 2-dimensional points, write a program that computes the area of their smallest bounding rectangle (smallest 阅读全文
摘要：
题目描述 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. 题目描述 阅读全文