The Frog's Games
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 6177 Accepted Submission(s): 3011
Problem Description
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).
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.
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<cstdio>
#include<algorithm>
using namespace std;
int L, n, m, pos;
int s[500010];
bool judge(int a){
int cnt = 0;
pos = 0;
for(int i = 0; i <= n; ){
if(pos + a >= s[i]){//最后一步肯定是>=s[n], 即终点位置,执行的这条语句,所以少计算了一步,后边判断时候加上
i++;
}
else{
if(pos == s[i-1]){//这是个坑,学长给的例子很好,如果青蛙在2,能跳8,下一个位置是11,不加这个判断会死循环在这
return false;
}
pos = s[i-1];
cnt++;
}
}
if(cnt+1 > m){
return false;
}
return true;
}
int main(){
while(~scanf("%d%d%d", &L, &n, &m)){
for(int i = 0; i < n; i++){
scanf("%d", &s[i]);
}
sort(s, s + n);
s[n] = L;
int ans = L, s = 0, e = L, m;//ans储存最小步数
while(s <= e){
m = (s + e) >> 1;//二分m步能不能过河
if(judge(m)){
ans = m;
e = m-1;
}
else{
s = m+1;
}
}
printf("%d\n", ans);
}
return 0;
}