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).
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define e 2.718281828459
#define INF 0x7fffffff
#pragma warning(disable:4996)
#define pf printf
#define sf scanf
#define max(a,b) (a)>(b)?(a):(b);
#define pi acos(-1.0);
#define eps 1e-9;
ull m, n,len;
ull ar[50005];
bool judge(ull mid) {
ll sum = 0;
ll pre=0;
for (ll i = 1; i <= n+1; i++) {
//假装岸也能移(其实可以这样想(从数据上来说等价的) 1:最后一块与岸间距离小于mid时,移的是最后一块
//2:若最后一块已被移除,则当pre与岸间距离小于mid时移除的是pre,
//即再区间[a,a+mid+x]中,之前移除的是区间后一块,最后一个组合移除的是前一块
if (ar[i] - ar[pre] <= mid)
sum++;//移除一个石头
else
pre = i;
}
if (sum <= m)//mid太小
return true;
else
return false;
}
int main(void) {
cin >>len>> n >> m;
for (int i = 1; i <= n; i++) sf("%lld", &ar[i]);
ar[0] = 0;
ar[n+1] = len;
sort(ar + 1, ar + 1 + n);
ull left = 0, right = len;
ull mid;
while (right >= left) {
mid = (left + right ) / 2;
if (judge(mid))
left = mid+1;//距离太小
else
right = mid-1;//距离太大
}
cout <<left << endl;
return 0;
}