Welcome

首页 / 软件开发 / 数据结构与算法 / Shanghai 2006 / UVa 1382 Distant Galaxy:枚举&扫描&动态维护

Shanghai 2006 / UVa 1382 Distant Galaxy:枚举&扫描&动态维护2014-07-25

1382 - Distant Galaxy

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460&page=show_problem&problem=4128

You are observing a distant galaxy using a telescope above the Astronomy Tower, and you think that a rectangle drawn in that galaxy whose edges are parallel to coordinate axes and contain maximum star systems on its edges has a great deal to do with the mysteries of universe. However you do not have the laptop with you, thus you have written the coordinates of all star systems down on a piece of paper and decide to work out the result later. Can you finish this task?

Input

There are multiple test cases in the input file. Each test case starts with one integerN ,(1N100) , the number of star systems on the telescope. N lines follow, each line consists of two integers: theX andY coordinates of theK -th planet system. The absolute value of any coordinate is no more than109 , and you can assume that the planets are arbitrarily distributed in the universe.

N = 0 indicates the end of input file and should not be processed by your program.

Output

For each test case, output the maximum value you have found on a single line in the format as indicated in the sample output.

Sample Input

10 2 3 9 2 7 4 3 4 5 7 1 5 10 4 10 6 11 4 4 6 0