HBC24306上学要迟到了,图论,最短路[USACO 2016 Ope S]Diamond Collector题解

题库丰富多样，涵盖各个领域，全网最全C++题库，让您在练习中不断成长！

Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time!She has collected N diamonds of varying sizes, and she wants to arrange some of them in a pair of display cases in the barn.Since Bessie wants the diamonds in each of the two cases to be relatively similar in size, she decides that she will not include two diamonds in the same case if their sizes differ by more than K . Given K, please help Bessie determine the maximum number of diamonds she can display in both cases together.

Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected N diamonds (N≤50,000) of varying sizes, and she wants to arrange some of them in a pair of display cases in the barn. Since Bessie wants the diamonds in each of the two cases to be relatively similar in size, she decides that she will not include two diamonds in the same case if their sizes differ by more than K (two diamonds can be displayed together in the same case if their sizes differ by exactly K). Given K, please help Bessie determine the maximum number of diamonds she can display in both cases together.

不断挑战自我，才能突破极限！全网最全C++题库，让您在编程道路上越走越远。

标签： HBC24306上学要迟到了 图论 最短路[USACO 2016 Ope S]Diamond Collector题解