// learn from https://discuss.leetcode.com/topic/6912/c-dp-solution

'''

class Solution {

public:

    int calculateMinimumHP(vector<vector<int>>& dungeon) {

        int m = dungeon.size(),n = dungeon[].size();

        vector<vector<int> >dp(m+,vector<int>(n+,INT_MAX));

        dp[m-][n] =;

        dp[m][n-] = ;

        for(int i = m-;i>=;i--){

            for(int j = n-;j>=;j--){

                dp[i][j] = min(dp[i][j+],dp[i+][j]) - dungeon[i][j];

                dp[i][j] = max(dp[i][j],);

            }

        }

        return dp[][];

    }

};

'''