zoukankan      html  css  js  c++  java
  • POJ3258(最大化最小值)

    River Hopscotch
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 11155   Accepted: 4785

    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 to 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: LN, 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

    #include <cstdio>
    #include <algorithm>
    using namespace std;
    const int MAXN=50005;
    int l,n,m;
    int x[MAXN];
    bool test(int d)
    {
        int cnt=0;
        int last=0;
        for(int i=0;i<n;i++)
        {
            if(x[i]-last<d)
            {
                cnt++;
                continue;
            }
            last=x[i];
        }
        if(l-last<d)    return false;
        return cnt<=m;
    }
    int main()
    {
        while(scanf("%d%d%d",&l,&n,&m)!=EOF)
        {
            for(int i=00;i<n;i++)
            {
                scanf("%d",&x[i]);
            }
            sort(x,x+n);
            int l=0,r=0x3f3f3f3f;
            while(r-l>1)
            {
                int mid=(l+r)>>1;
                if(test(mid))
                {
                    l=mid;
                }
                else
                {
                    r=mid;
                }
            }
            printf("%d
    ",l);
        }
        return 0;
    }
  • 相关阅读:
    cut的使用
    linux三剑客之一 sed
    uniq指令
    CF940A Points on the line 思维
    2018年全国多校算法寒假训练营练习比赛(第二场) B TaoTao要吃鸡 01背包变形题
    CF922A Cloning Toys
    牛客网 Wannafly挑战赛 C 列一列 简单题 (题目有点坑)
    牛客网 Wannafly挑战赛 A 找一找 思考题
    B. Tea Queue codeforces Round.37.div2 队列
    线段树+离散化 poj 2528 Mayor's posters
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5678493.html
Copyright © 2011-2022 走看看