1
var stoneGameVIII = function (S) {
2
  let n = S.length,
3
    prefix = [0],
4
    dp = [...Array(n)];
5
  for (let i = 0; i < n; i++) prefix.push(prefix[prefix.length - 1] + S[i]);
6
  let bestRight = prefix[n],
7
    bestCurrent;
8
  for (let i = n - 2; i >= 0; i--)
9
    (bestCurrent = bestRight),
10
      //update what you re going to use in the future
11
      (bestRight = Math.max(bestRight, prefix[i + 1] - bestCurrent));
12
  return bestCurrent;
13
};