CareerCup Divide n cakes to k different people

taoqick

于 2014-03-01 12:43:41 发布

阅读量970

点赞数

CC 4.0 BY-SA版权

分类专栏： careercup c++ 算法文章标签： careercup search

本文链接：https://blog.youkuaiyun.com/taoqick/article/details/20212403

算法同时被 3 个专栏收录

475 篇文章

订阅专栏

c++

265 篇文章

订阅专栏

careercup

86 篇文章

订阅专栏

本文探讨如何在派对中将不同口味的蛋糕平均分配给K名成员，确保每位成员获得相同体积的单一口味蛋糕，并尽量减少浪费。通过二分搜索算法实现最优分配策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

In a party there are n different-flavored cakes of volume V1, V2, V3 ... Vn each. Need to divide them into K people present in the
party such that
- Each member of party gets equal volume of cake (say V, which is the solution we are looking for)
- A given member should get a cake of single flavour only i.e. You cannot distribute parts of different flavored cakes to same
member.
- Minimum volume of cake gets wasted after distribution so that means a maximum distribution policy

-------------------------------------------------------------------------------------

Binary Search: We assume the volumes are int. If not, we should define an epi.

class Solution {
 public:
  bool isDivided(vector<int>& vi, int K, int v) {
     
  }
  int getVol(vector<int>& vi, int K) {
    int sum = 0, l = 0, r = 0, maxVol = 0, mid;
    sort(vi.begin(),vi.end(),greater<int>);
    for (int i = 0; i < vi.size(); ++i)
      sum += vi[i];
    l = vi[0] / K;
    r = sum / K;
    while (l <= r) {
      mid = (l + r) / 2;
      if (isDivided(vi, K, mid)) {
        if (mid > maxVol) {
          maxVol = mid;
          l = mid + 1;
        }
        else 
          r = mid - 1;
      }
      else
        r = mid - 1;
    }
    return maxVol;
  }
}