小看一下hint 又是binary search 我對binary search的聯想力真的很不構= = def minimizedMaximum(self, n: int, quantities: List[int]) -> int: def canbeDistributed(k): cnt = 0 for q in quantities: cnt += ceil(q/k) return cnt<=n l,r = 1, max(quantities) while l<r: mid = (l+r)//2 if canbeDistributed(mid): r = mid else: l = mid+1 return l -- ※ 發信站: 批踢踢實業坊(ptt-website.tw), 來自: 125.229.37.69 (臺灣) ※ 文章網址: https://ptt-website.tw/Marginalman/M.1731595786.A.F51