Cpp环境【POJ3045】【Vijos2982】Cow Acrobats 牛的杂技套路

最新推荐文章于 2021-11-18 21:29:05 发布

原创

最新推荐文章于 2021-11-18 21:29:05 发布 · 890 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#cpp #poj #贪心算法

这是一篇关于如何通过贪心算法解决编程问题的文章，具体情境是安排牛的堆叠顺序以最小化最危险的牛的倒塌风险。每头牛有重量和力量两个属性，目标是确定牛的排列方式，使得所有牛中风险最大的一头牛的倒塌风险最小。文章提供了一个实例和解决方案，强调了在比较牛的顺序时需要同时考虑重量和力量两个因素。

Description  【问题描述】

Farmer John’s N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope walking and swinging from the trapeze (and their last attempt at firing a cow out of a cannon met with a dismal failure). Thus, they have decided to practice performing acrobatic stunts.
The cows aren’t terribly creative and have only come up with one acrobatic stunt: standing on top of each other to form a vertical stack of some height. The cows are trying to figure out the order in which they should arrange themselves ithin this stack.
Each of the N cows has an associated weight (1 <= W_i <= 10,000) and strength (1 <= S_i <= 1,000,000,000). The risk of a cow collapsing is equal to the combined weight of all cows on top of her (not including her own weight, of course) minus her strength (so that a stronger cow has a lower risk). Your task is to determine an orderi