ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs ContestProblemSetList
Login Register

问题 C: Cow Rectangles

内存限制：128 MB 时间限制：1 S
题面：传统 评测方式：文本比较 上传者：
提交：9 通过：1
返回比赛提交提交记录

题目描述

Problem 1: Cow Rectangles [Nick Wu, 2015] The locations of Farmer John's N cows (1 <= N <= 500) are described by distinct points in the 2D plane. The cows belong to two different breeds: Holsteins and Guernseys. Farmer John wants to build a rectangular fence with sides parallel to the coordinate axes enclosing only Holsteins, with no Guernseys (a cow counts as enclosed even if it is on the boundary of the fence). Among all such fences, Farmer John wants to build a fence enclosing the maximum number of Holsteins. And among all these fences, Farmer John wants to build a fence of minimum possible area. Please determine this area. A fence of zero width or height is allowable.

题目描述
约翰的N(1 <= N <= 500)头奶牛的位置由坐标平面上的点来描述。这些奶牛分为两种：Holsteins 和 Guernseys。约翰想要修建一个矩形的围栏，围栏的边平行于x轴或者y轴，并且要求围栏中只有Holsteins类型的奶牛(一头奶牛在围栏的边边上也算在围栏以内)。
约翰想要使围栏围住进可能多的Holsteins奶牛，在此基础上，约翰希望围栏构成的矩形的面积尽可能小，请你计算出这个最小面积。
注意：围栏的长或宽为0的情况是允许的。

输入格式

The first line of input contains N. Each of the next N lines describes a cow, and contains two integers and a character. The integers indicate a point (x,y) (0 <= x, y <= 1000) at which the cow is located. The character is H or G, indicating the cow's breed. No two cows are located at the same point, and there is always at least one Holstein.

第一行输入包含N。
接下来的N行中，每一行描述cow包含两个整数和一个字符。整数表示奶牛所在的点（x，y）（0<=x，y<=1000）。字符为H或G，表示奶牛的品种。没有两头奶牛位于同一点上，而且总是至少有一头荷斯坦奶牛。

输出格式

Print two integers. The first line should contain the maximum number of Holsteins that can be enclosed by a fence containing no Guernseys, and second line should contain the minimum area enclosed by such a fence.

打印两个整数。第一行包含在霍尔斯泰山脉可以被没有根西岛的栅栏围起来的荷斯坦奶牛的最大值，第二行应该包含由这样一个栅栏划分后面积最小值。

输入样例 复制 

5
1 1 H
2 2 H
3 3 G
4 4 H
6 6 H

输出样例 复制 

2
1

分类标签