USACO 2011 Open Gold 1.Mowing the Lawn 修剪草坪

最新推荐文章于 2023-11-28 13:28:16 发布

magical_qting

最新推荐文章于 2023-11-28 13:28:16 发布

阅读量1.8k

点赞数

分类专栏： USACO 数据结构动态规划单调队列文章标签：单调队列动态规划

本文链接：https://blog.csdn.net/magical_qting/article/details/47205629

版权

该博客讨论了USACO竞赛中的一道题目，涉及如何在不超过K头连续奶牛的情况下，选择一组奶牛以最大化其总效率进行草坪修剪，而不让它们开始聚会。奶牛编号从1到N，每头奶牛的效率不同。约翰的目标是找出最大总效率的策略。

摘要由CSDN通过智能技术生成

Description

After winning the annual town competition for best lawn a year ago,
Farmer John has grown lazy; he has not mowed the lawn since then
and thus his lawn has become unruly. However, the competition is
once again coming soon, and FJ would like to get his lawn into
tiptop shape so that he can claim the title.

Unfortunately, FJ has realized that his lawn is so unkempt that he
will need to get some of his N (1 <= N <= 100,000) cows, who are
lined up in a row and conveniently numbered 1..N, to help him. Some
cows are more efficient than others at mowing the lawn; cow i has
efficiency E_i (0 <= E_i <= 1,000,000,000).

FJ has noticed that cows near each other in line often know each
other well; he has also discovered that if he chooses more than K
(1 <= K <= N) consecutive (adjacent) cows to help him, they will
ignore the