木棒切割问题——算法笔记P134

我理解的作者的意思就是先找到最长的那根木棒，然后利用对这根木棒二分出来的长度L再对其他木棒求，然后总数相加就是k了，和目标值K进行比对。
left = 0，right = 最长木棒长度

求得的木棒个数k >= K，下限left = mid + 1； k< K ,上限 right = mid;

#include
#include
using namespace std;

const int stickNum = 3;

int cut(int sticks[10], int k)
{
    int sum = 0;
    for(int i = 0; i < stickNum; i++)
    {
        sum += sticks[i] / k;
        //printf("%d ", sum);
    }
    //printf("\n");
    return sum;
}

int cmp(int a, int b)
{
    return a > b;
}

int main()
{
    int  sticks[stickNum];
    int n, K = 7;
    for(int i = 0; i < stickNum; i++)
    {
        scanf("%d", &n);
        sticks[i] = n;
    }
    sort(sticks, sticks+stickNum, cmp);
    int left = 0, right = sticks[0];
    int mid, num;
    while(left < right)
    {
        mid = left + (right - left) /2;
        num = cut(sticks,mid);
        if(num < K)
            right = mid;
        else
            left = mid+1;
    }
    printf("%d", left);
    return 0;
}