编辑代码

#include <stdio.h>

int max(int a, int b) {
    return (a > b) ? a : b;
}

int maxCoins(int board[][6], int n, int m) {
    int dp[n][m];

    // 初始化第一个元素
    dp[0][0] = board[0][0];

    // 初始化第一行和第一列
    for (int i = 1; i < n; i++)
        dp[i][0] = dp[i-1][0] + board[i][0];

    for (int j = 1; j < m; j++)
        dp[0][j] = dp[0][j-1] + board[0][j];

    // 动态规划递推
    for (int i = 1; i < n; i++) {
        for (int j = 1; j < m; j++) {
            dp[i][j] = board[i][j] + max(dp[i-1][j], dp[i][j-1]);
        }
    }

    // 返回右下角位置的最大硬币数
    return dp[n-1][m-1];
}

int main() {
    int board[3][3] = {
        {0, 0, 0,0,1,0},
        {0, 1, 0,1,0,0},
        {0, 0, 0,1,0,1},
        {0, 0, 1,0,0,1},
        {1, 0, 0,0,1,0},
    };

    int n = 5;
    int m = 6;

    int result = maxCoins(board, n, m);

    printf("最大硬币数: %d\n", result);

    return 0;
}