zoukankan      html  css  js  c++  java
  • poj 3258 River Hopscotch(二分搜索之最大化最小值)

    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

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

    Source

     
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 #include<map>
     6 #include<set>
     7 using namespace std;
     8 #define N 50006
     9 int dis[N];
    10 int L,n,m;
    11 bool solve(int min_dis){
    12     int last=0;
    13     int cnt=0;
    14     for(int i=1;i<=n+1;i++){
    15         if(dis[i]-dis[last]<=min_dis) cnt++;
    16         else last=i;
    17     }
    18 
    19     if(cnt>m) return true;
    20     return false;
    21 
    22 }
    23 int main()
    24 {
    25 
    26     while(scanf("%d%d%d",&L,&n,&m)==3){
    27         for(int i=1;i<=n;i++){
    28             scanf("%d",&dis[i]);
    29         }
    30 
    31         if(n==m){
    32             printf("%d
    ",L);
    33             continue;
    34         }
    35 
    36         dis[0]=0;
    37         dis[n+1]=L;
    38         sort(dis+1,dis+n+1);
    39         int low=0;
    40         int high=L;
    41         while(low<high){
    42             int mid=(low+high)>>1;
    43             if(solve(mid)){
    44                 high=mid;
    45             }
    46             else{
    47                 low=mid+1;
    48             }
    49         }
    50         printf("%d
    ",low);
    51     }
    52     return 0;
    53 }
    View Code
  • 相关阅读:
    北京太速科技股份有限公司产品手册V201903020
    204-基于Xilinx Virtex-6 XC6VLX240T 和TI DSP TMS320C6678的信号处理板
    375-基于TI DSP TMS320C6657、XC7K325T的高速数据处理核心板
    116-基于5VLX110T FPGA FMC接口功能验证6U CPCI平台 光纤PCIe卡
    115-基于TI TMS320DM6467无操作系统Camera Link智能图像分析平台
    95-基于FMC接口的2路CameraLink Base输出子卡模块
    88-基于FMC接口的2路CameraLink Base输入子卡模块
    IT男的别样人生,爱折腾,竟然辞职跑丽江去了
    如何扩展/删除swap分区
    Linux 中交换空间 (swap)应该分多大才好?
  • 原文地址:https://www.cnblogs.com/UniqueColor/p/4779538.html
Copyright © 2011-2022 走看看