Leetcode 3296. Minimum Number of Seconds to Make Mountain Height Zero

Given a mountain height H and workers where assigning x units to worker i costs workerTimes[i] * x*(x+1)/2 seconds, allocate integer reductions summing to H to minimize the makespan (maximum worker time). The core challenge is distributing workload across machines with convex (quadratic) cost functions, typically solved by binary-searching the time and checking each worker's maximum reducible units under that time.