问题描述:
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. But as time go es by, he
tires of watching the timid cows of the other farmers limp across the short distances b etween
ro cks placed to o closely togethe r. He plans to remove several ro cks in order to increase the
shortest distance a cow will have to jump to reach the end. He knows he cannot re move the
starting and ending ro cks, but he calculates that he has enough resources to remove up to M
ro cks (0 ≤ M ≤ N).
Farmer John wants to know exactly how much he can increase the shortest distance before he
starts removing the rocks. Help Farmer John determine the greatest possible shortest distance
a cow has to jump after removing the optimal set of M rocks. In other words, you need help
John to find a way to remove M blocks, so that in the rest of the blocks, the distance between
two adjacent blocks which have a minimum spacing is the largest