算法提高课第一章数字三角形模型

有一种图，从起点到终点只能向右或者向左，这种图后边的状态不会影响前边的状态，可以用dp求解。

AcWing 1015. 摘花生

AcWing 1018. 最低通行费

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 110;
int a[N][N];
int n;
int dp[N][N];
int main()
{
    memset(dp, 0x3f, sizeof dp);
    dp[0][1] = 0;
    cin >> n;
    for(int i = 1; i <= n; i ++ )
    for(int j = 1; j <= n; j ++ )
        cin >> a[i][j];
    for(int i = 1; i <= n; i ++ )
    for(int j = 1; j <= n; j ++ )
        dp[i][j] = a[i][j] + min(dp[i - 1][j], dp[i][j - 1]);
    cout << dp[n][n];
}

AcWing 1027. 方格取数

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 20;
int a[N][N];
int dp[N][N][N];
int main()
{
    //一个从a-b，一个从b - a
    int n;
    cin >> n;
    while(true)
    {
        int t, b, c;
        cin >> t >> b >> c;
        if(!t && !b && !c) break;
        a[t][b] = c;
    }
    for(int i1 = 1; i1 <= n; i1 ++ )
    for(int i2 = 1; i2 <= n; i2 ++ )
    for(int k = 2; k <= n * 2; k ++ )
    {
        int j2 = k - i2, j1 = k - i1;
        if(j2 < 1 || j1 < 1 || j2 > n || j1 > n) continue;
        dp[k][i1][i2] = a[i1][j1] + max({dp[k - 1][i1 - 1][i2 - 1], dp[k - 1][i1][i2], dp[k - 1][i1 - 1][i2], dp[k - 1][i1][i2 - 1]});
        if(i1 != i2) dp[k][i1][i2] += a[i2][j2];

    }
    cout << dp[n + n][n][n];
}

AcWing 275. 传纸条

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 55;
int a[N][N];
int dp[2 * N][N][N];
const int inf = 1e7;
int main()
{
    //一个从a-b，一个从b - a
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++ )
    for(int j = 1; j <= m; j ++ )
        cin >> a[i][j];
    for(int i1 = 1; i1 <= n; i1 ++ )
    for(int i2 = 1; i2 <= n; i2 ++ )
    for(int k = 2; k <= n + m; k ++ )
    {
        int j2 = k - i2, j1 = k - i1;
        if(j2 < 1 || j1 < 1 || j2 > m || j1 > m) continue;
        dp[k][i1][i2] = a[i2][j2] + a[i1][j1] + max({dp[k - 1][i1 - 1][i2 - 1], dp[k - 1][i1][i2], dp[k - 1][i1 - 1][i2], dp[k - 1][i1][i2 - 1]});
        if(i1 == i2)
        {
            if(i1 == 1 && k == 2) continue;
            if(i1 == n && k == n + m) continue;
            dp[k][i1][i2] = -inf;
        }

    }
    cout << dp[n + m][n][n];
}