Leetcode 2017. Grid Game

Two players traverse a 2×n grid from (0,0) to (1,n-1), the first robot moves and zeros out its path then the second moves to maximize collected points; the first aims to minimize the second's score. The task is to compute that optimal second-robot score — which reduces to choosing the column where the first robot moves down to minimize the maximum of the remaining top-row suffix and bottom-row prefix sums.