<PREV Problem:
NEXT>
Solved by 765 users: ...
UserDateAttemptTimeCMSC
Nakilon10 jan 2010Ruby801.57124 
david_it2118 apr 2008Ruby700.02163 
Ravent12 aug 2006FPC501.30176 
Jarovit15 nov 2004FPC1?.??176 
voruch14 dec 2004FPC1?.??176 
Vedun02 dec 2006C++100.05178 
Ravent22 dec 2006Kylix600.95178 
david_it2118 apr 2008Ruby500.02179 
extremeplay13 nov 2014Ruby300.02183 
vviswa10 jun 2007C++300.03183 
opsupwow15 nov 2011C++200.55183 
wuy03 mar 2004FPC3?.??184 
Languages
C++
398
FPC
185
C
108
Java
36
Kylix
35
Python
6
Ruby
4
Lua
1
Scheme
1
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 

One rectangle

Time limit = 5 seconds

In the square 0 ≤ x ≤ 100, 0 ≤ y ≤ 100 there are N points with integer coordinates.

You should find out rectangle which has no any of given point inside and has maximum possible area.

Remark: Points are permitted to be on the border of the rectangle.

Input First line has the number N, 1 ≤ N ≤ 100, next N lines has coordinates of N points.

Output Your program should output one number — maximum area.

Input#1
1
50 50

Output#1
5000

Input#2
3
25 25
50 50
75 75

Output#2
3750

Author:
Voroztsov Artem, MIPT contest, February 2003.
February 2003

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


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

SW soft NIX
ID = 3.236.97.49