acwing提高班-动态规划1

acwing提高班-动态规划1

从集合角度思考dp问题

最低通行费

#include <bits/stdc++.h>
using namespace std;

const int N = 105;
const int INF = 1e9;
int m[N][N];
int dp[N][N];

int main()
{
    int n;
    scanf("%d",&n);
    for (int i = 1; i <= n; ++i) 
        for (int j = 1; j <= n; ++j)
            scanf("%d",&m[i][j]);
        
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (i == 1 && j == 1) dp[i][j] = m[i][j];
            else {
                dp[i][j] = INF;
                if (i > 1) dp[i][j] = min(dp[i][j], dp[i - 1][j] + m[i][j]);
                if (j > 1) dp[i][j] = min(dp[i][j], dp[i][j - 1] + m[i][j]);
            }
        }
    }
    printf("%d\n",dp[n][n]);
    return 0;
}

方格取数

#include <bits/stdc++.h>
using namespace std;
const int N = 15;
int m[N][N];
int dp[N*2][N][N];

int main()
{
    int n;
    scanf("%d",&n);
    int a,b,c;
    while (cin>>a>>b>>c , a||b||c)m[a][b] = c;
    for(int k = 2;k<=2*n;k++)
        for(int i1 = 1;i1<=n;i1++)
            for(int i2=1;i2<=n;i2++){
                int j1 = k-i1;
                int j2 = k-i2;
                if(j1>=1 && j2>=1 && j1<=n && j2<=n){
                    int tmp = m[i1][j1];
                    if(i1 != i2)tmp += m[i2][j2];
                    int &x = dp[k][i1][i2];
                    x = max(x,dp[k-1][i1-1][i2-1]+tmp);
                    x = max(x,dp[k-1][i1-1][i2]+tmp);
                    x = max(x,dp[k-1][i1][i2-1]+tmp);
                    x = max(x,dp[k-1][i1][i2]+tmp);
                }
            }
    printf("%d\n",dp[2*n][n][n]);
    return 0;
}

本质来说，dp是图论的子集

如果是k取方格数，那么需要用到最小费用流的方法来做