error:
do not want to coding ANYMORE!!!
- compute the matrix from (0, 0) to (x, y), then get the matrix sums[][].
- for each point (x, y), compute its possible square, i.e., square from (x, y) to (x + dis, y + dis), distance from long to short.
I.e., dp[x][y] = sums[x][y] - sums[0][x] - sums[y][0] + sums[…][…]