poj3258

最新推荐文章于 2020-05-04 23:30:04 发布

WudHHH

最新推荐文章于 2020-05-04 23:30:04 发布

阅读量406

点赞数

CC 4.0 BY-SA版权

分类专栏：二分答案

本文链接：https://blog.csdn.net/qingqiu_WD/article/details/57127847

二分答案专栏收录该内容

4 篇文章

订阅专栏

River Hopscotch

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 12672		Accepted: 5440

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 distanceD_i from the start (0 < D_i < 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

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

Sample Output

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

这题曾经做过，表示当初完全做不出来。

题意：给出n个点，除了第一个点和最后一个点不能移动，问移掉m个点，求任意两点的距离的最小值的最大值。

题解：二分答案，最小值明显是一开始的任意两点距离的最小值，最大值就是L。然后在这个区间里边二分，求得最优解。还需要一个判断是否正确的can（）函数。时间复杂度是O（nlogn）；

代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <sstream>
#include <fstream>
#include <set>
#include <map>
#define INF 1e9
#define M_PI 3.14159265358979323846
using namespace std;
int L,n,m;
int s[50005];
bool can(int a)//判断函数
{
    int cnt = 0;
    int ss[50005];
    for (int i = 0;i <= n+1;i++)
        ss[i] = s[i];
    for (int i = 1;i <= n+1;i++)
    {
        if(ss[i] - ss[i-1] < a)
        {
            ss[i] = ss[i-1];
            cnt++;
        }
    }
    if(cnt > m)
        return false;
    else
        return true;
}

int main()
{
    while (cin>>L>>n>>m)
    {
        int mn = INF;
        for (int i = 1;i <= n;i++)
        {
            cin>>s[i];
            mn = min(mn,s[i]-s[i-1]);
        }
        s[n+1] = L;
        sort(s,s+n+1);
        int lb = mn,ub = L;
        while (ub-lb>1)
        {
            int mid = (ub+lb)/2;
            if(can(mid))
            {
                lb = mid;
            }
            else
            {
                ub = mid-1;
            }
        }
        if(can(ub))
            cout<<ub<<endl;
        else
            cout<<lb<<endl;
    }
    return 0;
}

加油加油