入门经典 DP 0-1背包问题

最新推荐文章于 2023-05-10 23:15:23 发布

cugfjp

最新推荐文章于 2023-05-10 23:15:23 发布

阅读量413

点赞数

文章标签：算法竞赛入门经典

本文链接：https://blog.csdn.net/cugfjp/article/details/9058517

版权

/*
0-1背包问题
*/
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int INF = 1<<30;
const int MAXN = 100;
int v[MAXN];
int w[MAXN];
int d[MAXN][MAXN];
int s[MAXN][MAXN];
int n, c;

void dp()
{
    memset(d, 0, sizeof(d));
    memset(s, 0, sizeof(s));
    for(int i=n; i>0; i--) {
        for(int j=0; j<=c; j++) {
            d[i][j] = d[i+1][j];
            if(j >= v[i] && d[i][j] < d[i+1][j-v[i]]+w[i]) {
                d[i][j] = d[i+1][j-v[i]] + w[i];
                s[i][j] = 1;
            }
        }
    }
}
void dp2()
{
    memset(d, 0, sizeof(d));
    memset(s, 0, sizeof(s));
    for(int i=1; i<=n; i++) {
        for(int j=0; j<=c; j++) {
            d[i][j] = d[i-1][j];
            if(j >= v[i] && d[i][j] < d[i-1][j-v[i]]+w[i]) {
                d[i][j] = d[i-1][j-v[i]] + w[i];
                s[i][j] = 1;
            }
        }
    }
}

void print(int i, int j) {
    if(i>n) return;
    if(s[i][j]) {
        printf("%d\n", i);
        print(i+1, j-v[i]);
    } else {
        print(i+1, j);
    }
}

void print2(int i, int j)
{
    if(i<1) return;
    if(s[i][j]) {
        print2(i-1, j-v[i]);
        printf("%d\n", i);
    } else {
        print2(i-1, j);
    }
}

int main(){
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif
    /*
    while(scanf("%d%d", &n, &c) == 2) {
        for(int i=1; i<=n; i++) {
            scanf("%d%d", &v[i], &w[i]);
        }

        dp();
        printf("MAX weight: %d\n", d[1][c]);
        print(1, c);

        dp2();
        printf("MAX weight: %d\n", d[n][c]);
        print2(n, c);
    }
    */
    int f[MAXN];
    while(scanf("%d%d", &n, &c) == 2) {
        memset(f, 0, sizeof(f));
        int V, W;
        for(int i=1; i<=n; i++) {
            scanf("%d%d", &V, &W);
            for(int j=c; j>=0; j--) {
                if(j >= V && f[j]<f[j-V]+W) {
                    f[j] = f[j-V] + W;
                }
            }
        }
        printf("MAX weight: %d\n", f[c]);
    }
    return 0;
}