Convention(二分答案)

题目

• Problem Description
  Cows from all over the world are arriving at the local airport to attend the convention and eat grass. Specifically, there are N cows arriving at the airport (1≤N≤10⁵) and cow i arrives at time t_i (0≤ti≤10⁹). Farmer John has arranged M (1≤M≤10⁵) buses to transport the cows from the airport. Each bus can hold up to C cows in it (1≤C≤N). Farmer John is waiting with the buses at the airport and would like to assign the arriving cows to the buses. A bus can leave at the time when the last cow on it arrives. Farmer John wants to be a good host and so does not want to keep the arriving cows waiting at the airport too long. What is the smallest possible value of the maximum waiting time of any one arriving cow if Farmer John coordinates his buses optimally? A cow’s waiting time is the difference between her arrival time and the departure of her assigned bus.
  It is guaranteed that MC≥N.
• Input
  The first line contains three space separated integers N, M, and C. The next line contains N space separated integers representing the arrival time of each cow.
• Output
  Please write one line containing the optimal minimum maximum waiting time for any one arriving cow.
• input
  6 3 2
  1 1 10 14 4 3
• output
  4

题意

用大巴车去接在机场的奶牛，一共有N头奶牛和M辆车，每辆车可以坐C头牛，每头牛在不同的时间到达机场
求在M辆车可以运送完所有N头奶牛的情况下，需要等待最长時候的牛最少需要等多久

思路

二分答案，log₂10⁹约为30次，每次10⁵头牛，时间复杂度允许
下一头牛的等待时间超过当前答案 或者 车已满 则换下一辆车，最后车剩余数量大于等于0，则时间可能可以继续缩短，否则需要增加时间

代码

#include <bits/stdc++.h>
using namespace std;

int cow[100100];//cow[i]=i-th cow arrival time;

int main() {
    int l=0,r=1e9;
    int wait=(l+r)>>1;
    int N , M, C;
    scanf("%d%d%d",&N,&M,&C);

    for(int i=1; i<=N; ++i)
        scanf("%d",cow+i);

    sort(cow+1,cow+1+N);
    cow[0]=cow[1];

    int c,n,m,ans;
    while(l<r) {
        for(m=M,c=0,n=1; m>=0 and n<=N; c=0,--m) {
            int p=n;
            ++c,++n;
            while( c<C and n<=N ) {
                if(cow[n]-cow[p]<=wait) {
                    ++c,++n;
                }
                else break;
            }
        }

        if(m>=0)//车够，缩短等待时间
            ans=wait,r=wait-1;
        else//车不够，增加等待时间
            l=wait+1;
        wait=(l+r)>>1;
    }

    for(m=M,c=0,n=1; m>=0 and n<=N; c=0,--m) {
        int p=n;
        ++c,++n;
        while( c<C and n<=N ) {
            if(cow[n]-cow[p]<=wait) {
                ++c,++n;
            }
            else break;
        }
    }
    if(m>=0)
        printf("%d\n",l);
    else
        printf("%d\n",ans);

    return  0;
}