Alex and Lee continue their games with piles of stones.  There are a number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].  The objective of the game is to end with the most stones. 
Alex and Lee take turns, with Alex starting first.  Initially, M = 1.
On each player's turn, that player can take all the stones in the first X remaining piles, where 1 <= X <= 2M.  Then, we set M = max(M, X).
The game continues until all the stones have been taken.
Assuming Alex and Lee play optimally, return the maximum number of stones Alex can get.
 
Example 1:
Input: piles = [2,7,9,4,4]
Output: 10
Explanation:  If Alex takes one pile at the beginning, Lee takes two piles, then Alex takes 2 piles again. Alex can get 2 + 4 + 4 = 10 piles in total. If Alex takes two piles at the beginning, then Lee can take all three piles left. In this case, Alex get 2 + 7 = 9 piles in total. So we return 10 since it's larger. 

 
Constraints:

1 <= piles.length <= 100
1 <= piles[i] <= 10 ^ 4

```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 stoneGameII(self, piles: List[int]) -> int:\n        @lru_cache(None)\n        def minimax(start, m, player):\n            if start >= len(piles):\n                return 0\n            if player == 1:\n                #Alex's turn\n                return max(sum(piles[start:start + x]) + minimax(start + x ,max(x, m),2) for x in range(1, 2*m + 1))\n            if player == 2:\n                return min(minimax(start + x, max(x, m), 1) for x in range(1, 2*m + 1))\n        # @lru_cache\n        # def getsum(start, end, input):\n        return minimax(0, 1, 1)\n        \n                \n                \n                \n                \n                \n                \n#         result = dict()\n#         result_min = dict()\n        \n#         def minimax(start, M, player):\n#             if start >= len(piles):\n#                 return 0\n#             if player == 1:\n#                 # maxnum = -1\n#                 if (start, M) in result:\n#                     return result[(start, M)]\n#                 maxnum = -1\n#                 for X in range(1, 2 * M + 1):\n#                     temp = minimax(start + X, max(X, M), 2) + sum(piles[start:start + X])\n#                     if temp > maxnum:\n#                         maxnum = temp\n#                 result[(start, M)] = maxnum\n#                 return maxnum\n                \n#             if player == 2:\n#                 #minimize\n#                 minnum = 10^5\n#                 if (start, M) in result_min:\n#                     return result_min[(start, M)]\n#                 minnum = 1000000\n#                 for X in range(1, 2 * M + 1):\n#                     temp = minimax(start + X, max(X, M), 1)\n#                     if temp < minnum:\n#                         minnum = temp\n#                 result_min[(start, M)] = minnum\n#                 return minnum\n#         res = minimax(0, 1, 1)\n#         print(result)\n#         print(result_min)\n#         return res\n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'stoneGameII'
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: 14022