Leetcode 1937. Maximum Number of Points with Cost

Choose one cell per row to maximize the sum of cell values minus the absolute column-distance cost between consecutive rows; the core challenge is computing DP transitions efficiently (using prefix-max/left-right sweeps) to avoid O(n^2) per row given up to 1e5 total cells.