Minimum Complexity Level

Problem Statement

Minimum Complexity Level Problem Description Alex is attending a software engineering conference where many lectures are presented, and the subject matter of each lecture has a certain complexity . Alex has already fixed the order in which they want to attend the lectures, and now has to split them across the days days of the conference. Alex must attend at least one lecture every day and must keep the planned order. The complexity of a day is the complexity of the most complex lecture attended that day, and the overall complexity of the conference is the sum of the complexities of all the days. In other words, split the array complexity into exactly days non-empty contiguous parts, without reordering it. The cost of a part is its largest element. Find the minimum possible total cost. Complete the function findMinComplexity(complexity, days) , which returns that minimum overall complexity. Input Format Read from standard input. n complexity[0] complexity[1] ... complexity[n-1] days Lin