The Frog's Games
64-bit integer IO format: %I64d Java class name: Main
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
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
Sample Input
6 1 2 2 25 3 3 11 2 18
Sample Output
4 11
Source
The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest
#include <iostream>
#include <climits>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N= 500011;
int a[N];
int judge(int k);
int l, n, m;
int main()
{
while(scanf("%d%d%d",&l,&n, &m)!=EOF)
{
a[0]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
int Max=-1;
for(int i=1;i<=n;i++)
{
Max=max(Max,a[i]-a[i-1]);
}
a[n+1]=l;
a[n+2]=INT_MAX;
Max=max(Max,a[n+1]-a[n]);
int li=Max-1,ri=l,mid;
while(mid=(li+ri)/2,li<ri)
{
if(judge(mid))
{
ri=mid;
}
else
{
li=mid+1;
}
}
printf("%d\n",ri);
}
return 0;
}
int judge(int k)
{
int now=0;
for(int i=1;i<=m;i++)
{
int j;
for(j=now;a[j+1]-a[now]<=k;j++);
now=j;
if(now==n+1)
{
return 1;
}
}
return 0;
}