#617 · #2503 · Maximum Number of Points From Grid Queries(矩阵查询可获得的最大分数)

You are given an m x n grid and queries. For each query q, start at the top-left and repeatedly move to an adjacent cell with a value strictly less than q, collecting points equal to the number of cells visited (the start counts). Return the answer for each query. Constraints: 1 <= m, n <= 1000, 1 <= queries.length <= 10^4, 1 <= grid[i][j], queries[i] <= 10^6.