Algoritmos/AP14q2.cpp at main · dsfs10/Algoritmos · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <iostream>
#define endl "\n"
using namespace std;

int max(int a, int b);
int knapsack(int n, int W, int* w, int* v, int** F);
int MFKnapsack(int i, int j, int* w, int* v, int** F);


int main(void) {
    int W, n, value, *w, *v, **F;
    cin >> n >> W;
    w = new int[n+1];
    v = new int[n+1];
    F = new int*[n+1];
    F[0] = new int[W+1];

    for(int i = 1; i <= n; i++) {
        int x, y;
        cin >> x >> y;
        w[i] = x;
        v[i] = y;

        F[i] = new int[W+1];
        for(int j = 1; j <= W; j++) {
            F[i][j] = -1;
        }
    }

    MFKnapsack(n, W, w, v, F); // top-down knapsack

    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= W; j++) {
            if(F[i][j+1] < 0 || F[i][j+1] > 9) {
                cout << F[i][j] << " ";
            }
            else {
                cout << F[i][j] << "  ";
            }
        }
        cout << endl;
    }

    return 0;
}

int max(int a, int b) {
    if(a > b) {
        return a;
    }
    else {
        return b;
    }
}

int knapsack(int n, int W, int* w, int* v, int** F) {
    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= W; j++) {
            if(i == 0 || j == 0) {
                F[i][j] = 0;
            }
            else if(w[i] <= j) {
                F[i][j] = max(F[i-1][j], v[i] + F[i-1][j-w[i]]);
            }
            else {
                F[i][j] = F[i-1][j];
            }
        }
    }

    return F[n][W];
}

int MFKnapsack(int i, int j, int* w, int* v, int** F) {
    int value;
    if(F[i][j] < 0) {
        if(j < w[i]) {
            value = MFKnapsack(i-1, j, w, v, F);
        }
        else {
            value = max(MFKnapsack(i-1, j, w, v, F), v[i] + MFKnapsack(i-1, j-w[i], w, v, F));
        }
        F[i][j] = value;
    }

    return F[i][j];
}