#753 · #1335 · Minimum Difficulty of a Job Schedule(工作计划的最低难度)

You have jobDifficulty and d days. Split the jobs, in the given order, into exactly d non-empty consecutive groups. A day's difficulty is the maximum job in it, and the schedule's difficulty is the sum over days. Return the minimum schedule difficulty, or -1 if impossible. Constraints: 1 <= d <= jobDifficulty.length <= 300, 0 <= jobDifficulty[i] <= 1000.