public int getMost(int[][] board) {

// write code here

int m = board.length;

int n = board[0].length;

int[][] f = new int[m+1][n+1];

for (int i =0;i < m;i++){

for (int j=0;j<n;j++){

if (i == 0){

if (j == 0){

f[i][j] = board[i][j];

}else {

f[i][j] = f[i][j-1] + board[i][j];

}

}else if (j == 0){

f[i][j] = f[i-1][j] + board[i][j];

}else {

f[i][j] = Math.max(f[i-1][j],f[i][j-1]) + board[i][j];

}

}

}

return f[m-1][n-1];

}