The annual Games in frogs’ kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog athletes to jump over the river. The width of the river is L (1<= L <= 1000000000). There are n (0<= n <= 500000) stones lined up in a straight line from one side to the other side of the river. The frogs can only jump through the river, but they can land on the stones. If they fall into the river, they
are out. The frogs was asked to jump at most m (1<= m <= n+1) times. Now the frogs want to know if they want to jump across the river, at least what ability should they have. (That is the frog’s longest jump distance).
Input
The input contains several cases. The first line of each case contains three positive integer L, n, and m.
Then n lines follow. Each stands for the distance from the starting banks to the nth stone, two stone appear in one place is impossible.
Output
For each case, output a integer standing for the frog’s ability at least they should have.
Sample Input
6 1 2
2
25 3 3
11
2
18
Sample Output
4
11
思路:最大值最小化问题,二分跳跃距离,判断是否可以在规定次数内跳到对岸。注意细节问题。
代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<string>
#define ll long long
using namespace std;
const int maxx=5e5+100;
int a[maxx];
int L,n,m;
inline bool wsd(int x)
{
int cnt=0;
int st=0,pos,flag=0;
while(1)
{
cnt++;
if(st+x>=L) break;
if(st==a[n]) return 0;
pos=upper_bound(a+1,a+1+n,st+x)-a;
st=a[pos-1];
if(flag==st) return 0;
flag=st;
}
return cnt<=m;
}
int main()
{
while(scanf("%d%d%d",&L,&n,&m)!=EOF)
{
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+1+n);
int l=1,r=1e9+10,mid;
while(l<=r)
{
mid=l+r>>1;
if(wsd(mid)) r=mid-1;
else l=mid+1;
}
printf("%d\n",l);
}
return 0;
}
努力加油a啊,(o)/~