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 goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N).
FJ 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.
Input
Line 1: Three space-separated integers: L, N, and M
Lines 2.. N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position.
Output
Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks
Sample Input
25 5 2 2 14 11 21 17
Sample Output
4
Hint
Before removing any rocks, the shortest jump was a jump of 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, the shortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25).
题意:一头牛在一个湖中央(0点),湖的半径为 l ( l点),从湖中央到岸边之间有一些石块 (xi点),这头牛可以an'z按照顺序踩着石块到岸上。现在主人要扯掉 m 块石块,使得牛必须跳的最小距离 最大。
思路:我们可以用二分枚举牛每次必须跳的最小距离,求最大值即可。
代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
ll n,m,l,num[50010];
const ll inf = 9999999999;
ll work(ll l,ll r) //二分枚举
{
while(l<=r)
{
ll mid=(l+r)>>1;
int ans=0,s=0;
for(int i=1; i<n; i++)
if(num[i]-num[s]>=mid)//i -> s 的距离大于 mid 了,所以要更新起点
s=i;
else ans++; //删去的石块数
if(ans>m) //可以删去石块的数量大于m,说明跳跃距离太大了
r=mid-1;
else
l=mid+1;
}
return r;
}
int main()
{
while(~scanf("%lld%d%d",&l,&n,&m))
{
num[0]=0,num[n+1]=l; //中央 ,岸边
for(int i=1; i<=n; i++)
scanf("%lld",&num[i]);
n+=2;
sort(num,num+n); //排序
ll minn=inf;
for(int i=1; i<n; i++)
minn=min(minn,num[i]-num[i-1]); //最小的跳跃距离
printf("%lld\n",work(minn,l));
}
}