ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 161 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
david_it21	`18 apr 2008`	Ruby	1	08.36	326
rvashegin	`01 nov 2007`	C++	1	00.16	430
bush	`10 apr 2003`	FPC	1	00.21	468
kage	`02 oct 2009`	C++	5	00.20	513
Vyshnya	`01 mar 2010`	C++	16	00.03	524
Savior	`14 mar 2006`	C++	1	00.03	526
ilia	`23 sep 2011`	C++	8	01.00	539
Fizmat_Zhomart	`29 dec 2006`	C++	5	00.45	553
superzz	`12 sep 2007`	C++	4	00.12	554
NDAT	`08 nov 2006`	FPC	1	01.32	558

Languages
C++	83
FPC	47
Kylix	15
Java	9
C	6
Ruby	1

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Two rectangles

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 x_i and y_i.

MAXX, MAXY, N ≤ 100, 0 ≤ x_i ≤ MAXX, 0 ≤ y_i ≤ MAXY,

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

Input#2

Output#2

0.75

Author:
Voroztsov Artem
16 February 2003

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