DP-Practice/Cutting a Rod.cpp at master · RitikJainRJ/DP-Practice · 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
#include<bits/stdc++.h>
using namespace std;

int maxProfit(int);
int _maxProfit(int);

int main(){
    int t, n;

    cin >> t;
    while(t--){
        cin >> n;
        cout << _maxProfit(n) << endl;
    }
    return 0;
}

int _maxProfit(int n){
    int p[n], arr[n + 1];

    for(int i = 0; i < n; i++)
        cin >> p[i];
    memset(arr, 0, sizeof(arr));
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(i <= j)
                arr[j] = max(arr[j], p[i - 1] + arr[j - i]);
        }
    }
    return arr[n];
}

int maxProfit(int n){
    int p[n], arr[n + 1][n + 1];

    for(int i = 0; i < n; i++)
        cin >> p[i];
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= n; j++){
            if(i == 0 || j == 0)
                arr[i][j] = 0;
            else if(i > j)
                arr[i][j] = arr[i - 1][j];
            else
                arr[i][j] = max(arr[i - 1][j], p[i - 1] + arr[i][j - i]);
        }
    }
    return arr[n][n];
}