Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 5127 | Accepted: 2232 |
Description
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
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
Sample Input
25 5 2 2 14 11 21 17
Sample Output
4
Hint
题意:
就是有一条长为l的河,上面分布着n个石头,牛能从石头跳向下一个石头,现在要移走m个石头,每种方案中石头之间都有个最小距离m,问哪种方案的m最大
解析:
一开始不知道用二分法,好吧,看了博客才知道原来可以用二分法。就是二分这些最短距离m,枚举每个石头,看该石头和前一个的石头的距离是否比m小,若比m小,那么就
移走该石头,最后比较移走的石头的数目num和m的大小,num比m大则向下二分,比m小向上二分
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int l,m,n,num;
int d[51000];
bool judge(int mid)
{
num = 0;
int temp = 0;//temp用来存储d[i]左边没被标记最大的数值,temp = 0存储开始的石块
for(int i = 1; i <= n; i ++)
{
if(d[i] - temp < mid )//若d[i]被移走了,则不更新temp,因为后面要把d[i+1]-d[i-1]和mid比较了
num ++;
else //若d[i]没有被移走,则更新temp
temp = d[i];
}
if(l - temp < mid)
num ++;
if(num <= m) return true ;
else return false;
}
int cmp(int a,int b)
{
return a < b;
}
int main()
{
while(scanf("%d%d%d",&l,&n,&m) != EOF)
{
if(n == 0)
{
printf("%d\n",l);
continue;
}
num = 0;
memset(d,0,sizeof(d));
for(int i = 1; i <= n; i ++)
scanf("%d",&d[i]);
sort(d+1,d+1+n,cmp);
int min = 0,max = d[n];
int ans;
while(min <= max)//二分最短距离
{
int mid = (max + min )/2;
if(judge(mid))
{
ans = mid;
min = mid + 1;
}
else
max = mid - 1;
}
printf("%d\n",ans);
}
return 0;
}