Maximum Number of Moves in a Grid

Given an m x n grid of positive integers, you may start at any cell in the first column and move only to the right-up, right, or right-down cell in the next column if that cell's value is strictly larger; return the maximum number of such moves possible. The core challenge is finding the longest strictly increasing path that advances exactly one column per step (a column-directed DAG / dynamic programming pattern).