动态规划，背包问题

背包问题

5 20
1 6
2 5
3 8
5 15
3 3
=>37
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 105, M = 1010;
ll dp[N][M];
int main()
{
    int n, V; cin >> n >> V;
    for (int i = 1; i <= n; i++){
        ll w, v; cin >> w >> v;
        for (int j = 0; j <= V; ++j){
            if (j >= w)dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v);
            else dp[i][j] = dp[i - 1][j];
        }
    }
    cout << dp[n][V] << "\n";
    return 0;
}

背包的优化

3 10 3
5 10
4 9
3 8
=>26
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e4+9;
ll dp[N][2];
int main()
{
    int n, m, k; cin >> n >> m >> k;
    for (int i = 1; i <= n; i++){
        ll w, v; cin >> w >> v;
        for (int j = m; j >= 0; --j){
            if (j >= w+k){
                dp[j][0] = max(dp[j][0] ,dp[j - w][0] + v);
                dp[j][1] = max(dp[j][1], dp[j - w][1] + v);
            }
            if (j >= w + k){
                dp[j][1] = max(dp[j][1], dp[j - w - k][0] + 2 * v);
            }
        }
    }
    cout << max(dp[m][0], dp[m][1]) << "\n";
    return 0;
}