2312. 卖木头块

2312. 卖木头块

---

题目链接：2312. 卖木头块

代码如下：

//动态规划：枚举切割位置+循环优化
//参考链接:https://leetcode.cn/problems/selling-pieces-of-wood/solutions/1611240/by-endlesscheng-mrmd
class Solution {
public:
    long long sellingWood(int m, int n, vector<vector<int>>& prices) 
    {
        vector<vector<int>> pr(m+1,vector<int>(n+1));
        for(const auto &p:prices)
        {
            pr[p[0]][p[1]]=p[2];
        }

        vector<vector<long long>> f(m+1,vector<long long>(n+1));
        for(int i=1;i<=m;i++)
        {
            for(int j=1;j<=n;j++)
            {
                f[i][j]=pr[i][j];
                for(int k=1;k<j;k++)
                    f[i][j]=max(f[i][j],f[i][k]+f[i][j-k]);// 垂直切割
                for(int k=1;k<i;k++)
                    f[i][j]=max(f[i][j],f[k][j]+f[i-k][j]);//水平切割
            }
        }
        return f[m][n];
    }
};