import java.util.*; // dp递推公式: dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + nums[i][j]; public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int m = input.nextInt(); int[][] matrix = new int[n][m]; for (int i = 0; i < n...