洛谷刷题小记——P1002 [NOIP2002 普及组] 过河卒

一、题目

二、CODE

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    //马能走的八个方向
    static int[][] steps = {{1, 2}, {2, 1}, {-1, 2}, {2, -1}, {1, -2}, {-2, 1}, {-1, -2}, {-2, -1}};

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int Bx = sc.nextInt(), By = sc.nextInt(), horseX = sc.nextInt(), horseY = sc.nextInt();

        //创建二维数组存储点的信息
        int[][] arr = new int[Bx + 1][By + 1];
        //马所在的位置为控制点
        arr[horseX][horseY] = 1;
        for (int i = 0; i < 8; i++) {
            //马跳跃之后落脚点的横坐标和纵坐标
            int xx = horseX + steps[i][0];
            int yy = horseY + steps[i][1];

            //判断马跳过之后的位置有没有越界
            if (xx <= Bx && xx >= 0 && yy <= By && yy >= 0) {
                arr[xx][yy] = 1;
            }
        }

        System.out.println(dp(arr));
    }

    public static long dp(int[][] arr) {
        int m = arr.length, n = arr[0].length;
        long[][] dp = new long[m][n];

        //dp数组初始化
        dp[0][0] = 1;
        for (int i = 1; i < m; i++) {
            dp[i][0] = arr[i][0] == 1 ? 0 : dp[i - 1][0] + dp[i][0];
        }
        for (int i = 1; i < n; i++) {
            dp[0][i] = arr[0][i] == 1 ? 0 : dp[0][i - 1] + dp[0][i];
        }

        //①arr[i][j] == 1，dp[i][j] = 0;
        //②arr[i][j] != 1，dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = arr[i][j] == 1 ? 0 : dp[i - 1][j] + dp[i][j - 1];
            }
        }

        return dp[m - 1][n - 1];
    }
}