动态规划DP基础篇

动态规划-传球游戏

题目链接

//动态规划DP基础篇-传球游戏
#include<bits/stdc++.h>
using namespace std;
int n, m;
int dp[50][50];
//dp[i][j]球传了i次后第j位同学拿到球的方案总数
int main(){
    cin >> n >> m;
    dp[0][1] = 1;
    for (int i = 1; i <= m; i++){
        for (int j = 1; j <= n; j++){
            if (j == 1){
                dp[i][1] = dp[i - 1][2] + dp[i - 1][n];
            }
            else if (j == n){
                dp[i][n] = dp[i - 1][n - 1] + dp[i - 1][1];
            }
            else {
                dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j + 1];
            }
        }
    }
    printf("%d\n", dp[m][1]);
    return 0;
}

动态规划-小A点菜

题目链接

上篇中提到的方案总数问题

//动态规划DP基础篇-小A点菜
#include<bits/stdc++.h>
using namespace std;
int M, N;
int dp[10000], money[200];
//dp[j]表示花费j点菜的总方案数
int main(){
    cin >> N >> M;
    for (int i = 0; i < N; i++){
        cin >> money[i];
    }
    dp[0] = 1;
    for (int i = 0; i < N; i++){
        for (int j = M; j >= money[i]; j--){
            dp[j] += dp[j - money[i]];
        }
    }
    printf("%d\n", dp[M]);
    return 0;
}

动态规划-最大正方形

题目链接

//动态规划DP基础篇-最大正方形
#include<bits/stdc++.h>
using namespace std;
int n, m, ans;
int dp[100][100], nums[100][100];
//dp[i][j]表示以（i，j）为右下角能取到的的最大边长
int main(){
    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            cin >> nums[i][j];
        }
    }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            if (nums[i][j] == 1){
                dp[i][j] = min(min(dp[i][j - 1], dp[i - 1][j - 1]), dp[i - 1][j]) + 1;
                ans = max(ans, dp[i][j]);
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}