We partition a row of numbers A into at most K adjacent (non-empty) groups, then our score is the sum of the average of each group. What is the largest score we can achieve?
Note that our partition must use every number in A, and that scores are not necessarily integers.
Example:
Input: 
A = [9,1,2,3,9]
K = 3
Output: 20
Explanation: 
The best choice is to partition A into [9], [1, 2, 3], [9]. The answer is 9 + (1 + 2 + 3) / 3 + 9 = 20.
We could have also partitioned A into [9, 1], [2], [3, 9], for example.
That partition would lead to a score of 5 + 2 + 6 = 13, which is worse.

 
Note: 

1 <= A.length <= 100.
1 <= A[i] <= 10000.
1 <= K <= A.length.
Answers within 10^-6 of the correct answer will be accepted as correct.

```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 largestSumOfAverages(self, A: List[int], K: int) -> float:\n        #larger sum in subarray group 往dp想，一般都是第一类区间dp\n        #这类区间的套路就是dp[i][k] 前i个分成k个group的最优解\n        #转移方程\n  #      for (i=1; i<=N; i++)\n  #         for (k=1; k<=min(i,K); k++)\n  #     // find the best break point j （jd的区间就是i - k, c从高到低）\n  #             for (int j=i; j>=k; j--)\n  #                 dp[i][k] = max(dp[i][k], dp[j-1][k-1] + sum[j:i] );\n\n\n        n = len(A)\n        A = [0] + A\n        dp = [[0]*(K+1) for _ in range(n+1)]\n        \n        for i in range(1, n+1):\n             dp[i][0] = -float('inf')\n        \n        for i in range(1, n+1):\n            for k in range(1, min(i+1, K+1)):\n                sum_s = 0\n                #这里j要从最大的往回走，才能统计sum\n                for j in range(i, k-1, -1):\n                    sum_s += A[j]\n                    dp[i][k] = max(dp[i][k], dp[j-1][k-1] + sum_s/(i-j + 1))\n        \n        res = 0 \n        for i in range(1, K+1):\n            res = max(res, dp[n][i])\n        \n        return res\n\n\n\n\n\n\n\n  # \n#         n = len(A)\n#         dp = [[0]*(K+1) for _ in range(n+1)]\n        \n#         A = [0] + A\n        \n#         for i in range(1, n+1):\n#             dp[i][0] = -float('inf')\n        \n#         for i in range(1, n+1):\n#             for k in range(1, min(K+1, i+1)):\n#                 #\n#                 sum_s = 0\n#                 for j in range(k, i+1):\n#                     sum_s += A[j]\n#                     dp[i][k] = max(dp[i][k], dp[j-1][k-1] + sum_s//(i-j+1) )\n        \n#         res = 0\n#         for i in range(1, K+1):\n#             res = max(res, dp[n][i])\n#         print(dp)\n#         return res\n     \n    \n    \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'largestSumOfAverages'
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: 6946