A898.Landscaping--Platinum

提高+/省选-

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

Farmer John's NN cows (3N50,0003 \leq N \leq 50,000) are all located at distinct
positions in his two-dimensional field. FJ wants to enclose all of the cows
with a rectangular fence whose sides are parallel to the x and y axes, and he
wants this fence to be as small as possible so that it contains every cow
(cows on the boundary are allowed).
FJ is unfortunately on a tight budget due to low milk production last quarter.
He would therefore like to enclose a smaller area to reduce maintenance costs,
and the only way he can see to do this is by building two enclosures instead
of one. Please help him compute how much less area he needs to enclose, in
total, by using two enclosures instead of one. Like the original enclosure,
the two enclosures must collectively contain all the cows (with cows on
boundaries allowed), and they must have sides parallel to the x and y axes.
The two enclosures are not allowed to overlap -- not even on their boundaries.
Note that enclosures of zero area are legal, for example if an enclosure has
zero width and/or zero height.

输入格式

The first line of input contains NN. The next NN lines each contain two
integers specifying the location of a cow. Cow locations are positive integers
in the range 11,000,000,0001 \ldots 1,000,000,000.

输出格式

Write a single integer specifying amount of total area FJ can save by using
two enclosures instead of one.

输入输出样例

  • 输入#1

    6
    4 2
    8 10
    1 1
    9 12
    14 7
    2 3
    

    输出#1

    107
    
首页