dp [ i ] [ j ] represents the minimum initial points player should have so that when starts with cell ( i , j ) successfully reaches the destination cell ( m - 1 , n - 1 )
int dp [ R ] [ C ] ; int m = R , n = C ;