<PREV Problem:
NEXT>
Solved by 161 users: ...
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 

Two rectangles

Time limit = 2 second(s)

Big rectangle A is defined via inequalities 0 ≤ xMAXX, 0 ≤ yMAXY, 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 ≤ xiMAXX, 0 ≤ yiMAXY,

Output Maximum sum area of two rectangles B and C with 2-digits precision.

Input#1
1 1 1
0.5 0.5
Output#1
1

Input#2
1 1 3
0.25 0.25
0.5 0.5
0.75 0.75

Output#2
0.75

Author:
Voroztsov Artem
16 February 2003

<PREV | Problem set | Search related messages | NEXT>


© acm.mipt DevGroup
The page was generated in 190ms

SW soft NIX
ID = 54.198.246.116