每年奶牛都会举办一场特殊的跳石比赛，参赛者需要从起点到终点，途中经过多个位于河中的岩石。题目要求在允许移除最多M块石头的情况下，找到能最大化最短跳跃距离的方法。帮助农夫约翰计算在移除最佳石头组合后的最大最短跳跃距离。
Description
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distance Di from the start (0 < Di < L).
To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river.
Farmer John is proud of his cows and watches this event each year. Bu
最低0.47元/天 解锁文章
183
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
