DSA_cpp/DP/lec10_75.cpp at main · Jashans254/DSA_cpp · 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
//{ Driver Code Starts
// Initial Template for C++

#include <bits/stdc++.h>
using namespace std;


// } Driver Code Ends

// User function Template for C++

class Solution {
  public:

int f(int ind , int N , vector<int> &price , vector<vector<int>>&dp){

    if(ind == 0){
        return N * price[0];
    }
    if(dp[ind][N]!=-1) return dp[ind][N];
    int notTake = 0 + f(ind-1 , N , price ,dp);
    int take = INT_MIN;

    int rodLength = ind +1 ;
    if( rodLength <=N){

        take = price[ind] + f(ind , N- rodLength ,price,dp);
    }

    return dp[ind][N] = max(take , notTake);
}
    int cutRod(vector<int> &price) {
        // code here

        int n = price.size();

        vector<vector<int>>dp (n , vector<int>( n+1 , 0));

        vector<int> prev(n+1 , 0);
        for(int N = 0 ; N<=n; N++){
            prev[N] =  N * price[0];
        }

        for(int ind = 1 ; ind<n;ind++){

            for(int N = 0 ; N<=n;N++){
                    int notTake = 0 + prev[ N ];
                    int take = INT_MIN;

                    int rodLength = ind +1 ;
                    if( rodLength <=N){

                    take = price[ind] + prev[ N- rodLength ];
                    }

                    prev[N] = max(take , notTake);
            }
        }
        return prev[ n];
    }
};


//{ Driver Code Starts.

int main() {
    int t;
    scanf("%d ", &t);
    while (t--) {

        vector<int> a;
        string input;
        getline(cin, input);
        stringstream ss(input);
        int number;
        while (ss >> number) {
            a.push_back(number);
        }

        Solution ob;

        cout << ob.cutRod(a) << endl;
        cout << "~" << endl;
    }
    return 0;
}
// } Driver Code Ends