You want to schedule a list of jobs in d days. Jobs are dependent (i.e To work on the i-th job, you have to finish all the jobs j where 0 <= j < i).
You have to finish at least one task every day. The difficulty of a job schedule is the sum of difficulties of each day of the d days. The difficulty of a day is the maximum difficulty of a job done in that day.
Given an array of integers jobDifficulty and an integer d. The difficulty of the i-th job is jobDifficulty[i].
Return the minimum difficulty of a job schedule. If you cannot find a schedule for the jobs return -1.
 
Example 1:

Input: jobDifficulty = [6,5,4,3,2,1], d = 2
Output: 7
Explanation: First day you can finish the first 5 jobs, total difficulty = 6.
Second day you can finish the last job, total difficulty = 1.
The difficulty of the schedule = 6 + 1 = 7 

Example 2:
Input: jobDifficulty = [9,9,9], d = 4
Output: -1
Explanation: If you finish a job per day you will still have a free day. you cannot find a schedule for the given jobs.

Example 3:
Input: jobDifficulty = [1,1,1], d = 3
Output: 3
Explanation: The schedule is one job per day. total difficulty will be 3.

Example 4:
Input: jobDifficulty = [7,1,7,1,7,1], d = 3
Output: 15

Example 5:
Input: jobDifficulty = [11,111,22,222,33,333,44,444], d = 6
Output: 843

 
Constraints:

1 <= jobDifficulty.length <= 300
0 <= jobDifficulty[i] <= 1000
1 <= d <= 10

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "class Solution:\n    def minDifficulty(self, jobDifficulty: List[int], d: int) -> int:\n        n = len(jobDifficulty)\n        if d > n:\n            return -1\n        elif d == n:\n            return sum(jobDifficulty)\n        else:            \n            '''\n                1. can only do job i if job[0] ~ job[i-1] are done\n                2. if cur job is t(i), we can put t(i+1) ~ t(j - 1) into the same day while t(i + 1) ~ t(j - 1) are all smaller than t(i)\n                3. if t(j) >= t(i), then we must make a choice\n                4. should we start from the end of the jobs? \n                    -> should be the same\n                5. this should be a knapsack problem. \n                    -> for each day and each task, should we do it in the cur day? or the next day?                \n                    -> and there will be the same node -> need memo\n                    -> can we do bottom up?\n                    \n                6. \n                    dateIndex = 0 ~ (d - 1)\n                    jobStartIndex = 0 ~ (n - 1)           \n                    \n                    dp[i][j]: the min cost at day i, job j                    \n                    dp[i][j] = min(today's cost + future cost)\n                                = min( \n                                        only do job-j: \n                                            jobDifficulty[j] + dp[i + 1][j + 1]\n                                        do job-j, job-j + 1:\n                                            max(jobDifficulty[j], jobDifficulty[j + 1]) + dp[i + 1][j + 2]                                        \n                                        ...\n                                        \n                                        do max(jobDifficulty[j],..., jobDifficulty[n - 1]) + dp[i + 1][n]                                        \n                                        )\n                    so we need to do i + 1 first and j + 1 first            \n            '''\n            n = len(jobDifficulty)\n            dp = dict()\n            for d in range(0, d + 1):\n                dp[d] = dict()                     \n                for j in range(0, n + 1):\n                    dp[d][j] = float('inf')\n            \n            dp[d][n] = 0\n                            \n            for i in range(d - 1, -1, -1):                                                           \n                for j in range(n - 1, i - 1, -1):                    \n                    for k in range(j, n): #do job j ~ k, k = j ~ n - 1, so the next day start from job k + 1\n                        futureCost = dp[i + 1][k + 1]\n                        todayCost = max(jobDifficulty[j:k + 1])                                       \n                        #print([i, j, k])                                                                                                   \n                        dp[i][j] = min(dp[i][j], todayCost + futureCost)                    \n                                                                    \n            return dp[0][0]\n                    \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'minDifficulty'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 7530