algorithm_lab/rodcutting.cpp at main · imashiqe/algorithm_lab · 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
#include <iostream>
#include <algorithm>

using namespace std;

int cutRod(int prices[], int n) {
    int mat[n + 1][n + 1];

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            if (i == 0 || j == 0) {
                mat[i][j] = 0;
            } else {
                if (i == 1) {
                    mat[i][j] = j * prices[i - 1];
                } else {
                    if (i > j) {
                        mat[i][j] = mat[i - 1][j];
                    } else {
                        mat[i][j] = max(prices[i - 1] + mat[i][j - i], mat[i - 1][j]);
                    }
                }
            }
        }
    }

    return mat[n][n];
}

int main() {
    int prices[] = {2, 5, 7, 8};
    int n = sizeof(prices) / sizeof(prices[0]);

    cout << "Maximum profit: " << cutRod(prices, n) << endl;

    return 0;
}