2021-04-18 acwing 今日学习

动态规划

1.01背包
自闭门

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

const int N = 1010;

int v[N], w[N];
int n, m;
int f[N][N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];

    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j <= m; j ++ )
        {
            f[i][j] = f[i - 1][j];
            if (j >= v[i]) f[i][j] = max(f[i][j], f[i - 1][j - v[i]] + w[i]);
        }
        cout << f[n][m] << endl;

        return 0;
}
一维优化

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

const int N = 1010;

int v[N], w[N];
int n, m;
int f[N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];

    for (int i = 1; i <= n; i ++ )
        for (int j = m; j >= v[i]; j -- )
        {
            f[j] = max(f[j], f[j - v[i]] + w[i]);
        }
        cout << f[m] << endl;

        return 0;
}

2.完全背包
自闭门

朴素做法

#include <iostream>
using namespace std;

const int N = 1010;

int n, m;
int w[N], v[N], f[N][N];

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];

    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j <= m; j ++ )
            for (int k = 0; k * v[i] <= j; k ++ )
                f[i][j] = max(f[i][j] ,f[i - 1][j - k * v[i]] + k * w[i]);
    cout << f[n][m] << endl;

    return 0;
}
二维优化

#include <iostream>
using namespace std;

const int N = 1010;

int n, m;
int w[N], v[N], f[N][N];

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];

    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j <= m; j ++ )
        {
            f[i][j] = f[i - 1][j];
            if (v[i] <= j) f[i][j] = max(f[i][j], f[i][j - v[i]] + w[i]);
        }
    cout << f[n][m] << endl;

    return 0;
}
一维优化

#include <iostream>
using namespace std;

const int N = 1010;

int n, m;
int w[N], v[N], f[N];

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];

    for (int i = 1; i <= n; i ++ )
        for (int j = v[i]; j <= m; j ++ )
        {
            f[j] = max(f[j], f[j - v[i]] + w[i]);
        }
    cout << f[m] << endl;

    return 0;
}

呜呜，为什么我的图片翻不过来。