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

    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. 
     
    1. 从1到最远的距离二分枚举距离。判断是否满足条件。
    2. 判断过程中,距离不够就继续加。够了就计数加一。最后判断计数和牛的数量。如果计数少了。那么距离大了。如果计数多了。距离太小。
    3. 根绝返回值的情况。必须保证计数大于等于牛的数量,也就是最后符合的值是放在了l-1上。
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <algorithm>
     4 using namespace std;
     5 int a[100002];
     6 int n,c;
     7 bool check(int mid)
     8 {
     9     int sum = 0,cnt = 1;
    10     for(int i=n-1;i>=1;i--)
    11     {
    12         if(a[i+1]-a[i]+sum>=mid)
    13         {
    14             cnt++;
    15             sum = 0;
    16         }
    17         else
    18         {
    19             sum+=a[i+1]-a[i];
    20         }
    21     }
    22     if(cnt<c)
    23         return false;
    24     else
    25         return true;
    26 }
    27 int main()
    28 {
    29     while(~scanf("%d%d",&n,&c))
    30     {
    31         int l=1,r = -1,mid;
    32         for(int i=1;i<=n;i++)
    33         {
    34             scanf("%d",&a[i]);
    35         }
    36         sort(a+1,a+n+1);
    37         r = a[n];
    38         while(r>=l)
    39         {
    40             mid = (l+r)>>1;
    41             if(check(mid))
    42                 l = mid+1;
    43             else
    44                 r = mid-1;
    45         }
    46         printf("%d
    ",l-1);
    47     }
    48     return 0;
    49 }
     
    注:转载请注明出处
  • 相关阅读:
    23种设计模式之责任链模式
    23种设计模式之中介者模式
    23种设计模式之代理模式
    23种设计模式之原型模式
    23种设计模式之模板方法模式
    23种设计模式之建造者模式
    23中设计模式之抽象工厂模式
    批处理产生001到999之间的数字
    批处理随机显示星期几
    批处理简易密码登录
  • 原文地址:https://www.cnblogs.com/1625--H/p/9368529.html
Copyright © 2011-2022 走看看