poj 3258 River Hopscotch(二分答案)

10 篇文章 0 订阅
River Hopscotch
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 5174 Accepted: 2251

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 distanceDi 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 toM rocks (0 ≤ MN).

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 ofM 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).

题意:有一条河长为L,首尾各有一个石子,它们之间有N个石子,要求移走除首尾外的M个石子,使得剩下的每两个石子之间的最短距离最大。
思路:从1——L二分答案。

AC代码:
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <iostream>

using namespace std;

int rock[50005];
int L,N,M;
bool judge(int d)
{
    int cnt=0,last=0;
    for(int i=1;i<N;i++)
    {
    if(rock[i]-rock[last]<d)
    cnt++;
    else
    last=i;
    }
    if(cnt<=M)
    return true;
    return false;
}
int main()
{
   while(scanf("%d%d%d",&L,&N,&M)!=EOF)
   {
       rock[0]=0;
       rock[N+1]=L;
       for(int i=1;i<=N;i++)
       scanf("%d",&rock[i]);
       N+=2;
       sort(rock,rock+N);
       int low=1,high=L;
       int mid;
       while(low<=high)
       {
           mid=(low+high)>>1;
           if(judge(mid))
           low=mid+1;
           else
           high=mid-1;
       }
       cout<<mid<<endl;
   }
   return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值