| Online MIPT programming contest | РУССКИЙ |
| <PREV Problem: | NEXT> |
< |
|---|
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#11 50 50 |
Output#15000 |
Input#23 25 25 50 50 75 75 |
Output#23750 |
Author:
Voroztsov Artem, MIPT contest, February 2003.
February 2003
© acm.mipt DevGroup The page was generated in 330ms |