Given the Cartesian coordinates of n (> 0) 2-dimensional points, write a program that computes the area of their smallest bounding rectangle (smallest rectangle containing all the given points). (> 0) 2-dim
阅读背景：
Smallest Bounding Rectangle(最小面积外接矩形)
来源：互联网
分享到：
