Online MIPT programming contest | РУССКИЙ |
<PREV Problem: | NEXT> |
< |
---|
Time limit = 2 second(s)
Big rectangle A is defined via inequalities 0 ≤ x ≤ MAXX, 0 ≤ y ≤ MAXY, where x and y are cartesian coordinates. There are N marked points inside the rectangle.Rectangles B and C have sides parrallel to the sides of A. Intersection of B and C has null area. B and C have no marked points inside.
Please, write program which can determine maximum sum area of the rectangles B and C.
Input First line contains MAXX MAXY N. Then N lines follow. Each line contains coordinates of the i-th marked point two real numbers xi and yi.
MAXX, MAXY, N ≤ 100, 0 ≤ xi ≤ MAXX, 0 ≤ yi ≤ MAXY,
Output Maximum sum area of two rectangles B and C with 2-digits precision.
Input#11 1 1 0.5 0.5 |
Output#11 |
Input#21 1 3 0.25 0.25 0.5 0.5 0.75 0.75 |
Output#20.75 |
Author:
Voroztsov Artem
16 February 2003
© acm.mipt DevGroup The page was generated in 190ms |