Company: uber_13oct
Difficulty: medium
Load Balancing Problem Description You are building a prototype of a resource allocation system for a distributed parallel computing framework. There are n resources and m jobs to schedule. The jobs are given in a fixed order, and the i -th job has a processing time of burstTime[i] . The total load time of a resource is the sum of the burst times of the jobs assigned to it. Each resource can only be allocated jobs that form a contiguous segment of the array, that is, the jobs at indices x, x + 1, x + 2, ..., y for some x <= y . Every job must be assigned to exactly one resource. Determine the minimum possible value of the maximum total load time across all resources. Complete the function getMinMaxLoadTime(n, burstTime) , which returns that minimum as a 64-bit integer. Input Format Read from standard input: The first line contains the integer n , the number of resources. The second line contains the integer m , the number of jobs. Each of the next m lines contains one integer, burst