zoukankan      html  css  js  c++  java
  • POJ 2456 Aggressive cows

    Aggressive cows
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 11192   Accepted: 5492

    Description

    Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000). 

    His C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ want to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?

    Input

    * Line 1: Two space-separated integers: N and C 

    * Lines 2..N+1: Line i+1 contains an integer stall location, xi

    Output

    * Line 1: One integer: the largest minimum distance

    Sample Input

    5 3
    1
    2
    8
    4
    9

    Sample Output

    3

    Hint

    OUTPUT DETAILS: 

    FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3. 

    Huge input data,scanf is recommended.

    Source

     
     
     
    解析:最大化最小值(二分)
     
     
     
    #include <cstdio>
    #include <algorithm>
    using namespace std;
    
    const int MAXN = 100000+5;
    int a[MAXN];
    int n, c;
    
    bool ok(int d)
    {
        int pre = 0;
        for(int i = 1; i < c; ++i){
            int cur = pre+1;
            while(cur < n && a[cur]-a[pre] < d)
                ++cur;
            if(cur == n)
                return false;
            pre = cur;
        }
        return true;
    }
    
    int main()
    {
        scanf("%d%d", &n, &c);
        for(int i = 0; i < n; ++i)
            scanf("%d", &a[i]);
        sort(a, a+n);
        int l = 0, r = 0x7fffffff;
        while(r-l > 1){
            int mid = (l+r)/2;
            if(ok(mid)) l = mid;
            else r = mid;
        }
        printf("%d
    ", l);
        return 0;
    }
    

      

  • 相关阅读:
    eslint 入门项目搭建过程
    ES6 模块化笔记
    闭包
    JavaScript 内存相关知识
    Mac 配置Charles,抓取移动设备数据
    jquery.cookie的path坑
    如何模拟click事件,打开一个a标签链接?
    6月份开发问题整理
    js 淡入淡出的tab选项卡
    点击弹出模态框-以登录表单为例
  • 原文地址:https://www.cnblogs.com/inmoonlight/p/5747124.html
Copyright © 2011-2022 走看看