当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2008:Moo University - Team Tryouts

题目描述
N (1 <= N <= 1,000) calves try out for the Moo U gymnastics team this year, each with a positive integer height and a weight less than 100,000. Your goal is to select a team of as many calves as possible from this group. There is only one constraint the team must satisfy: the height H and weight W of each calf on the team must obey the following inequality:
A*(H-h) + B*(W-w) <= C

where h and w are the minimum height and weight values over all calves on the team, and A, B and C are supplied positive integral constants less than 10,000. Compute the maximum number of calves on the team.
输入解释
* Line 1: A single integer, N

* Line 2: Three space-separated integers, A, B and C

* Lines 3..N+2: Two space-separated integers: respectively the height and weight of a calf
输出解释
* Line 1: One integer, the maximum number of calves on the team.
输入样例
8
1 2 4
5 1
3 2
2 3
2 1
7 2
6 4
5 1
4 3
输出样例
5
提示
Calves 1, 2, 3, 4 and 7, for example, form a legal team. A larger team is impossible.

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 USACO 2004 March Green

源链接: POJ-2008

最后修改于 2020-10-29T06:20:25+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536