Advertisement
Kali_prasad

rod cutting problem

Jun 15th, 2022
25
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.25 KB | None | 0 0
  1. #pragma GCC optimize ("O3")
  2. #pragma GCC target ("sse4")
  3.  
  4. #include <bits/stdc++.h>
  5. using namespace std;
  6.  
  7. typedef long long ll;
  8. typedef pair<int, int> pii;
  9. typedef pair<string,int> psi;
  10. typedef priority_queue<int> pqmax;
  11. typedef priority_queue<int,vector<int>,greater<int>> pqmin;
  12. typedef unordered_map<int,int> mii;
  13. typedef unordered_map<long long,long long> mll;
  14. typedef unordered_map<string,int> msi;
  15. typedef unordered_map<char,int> mci;
  16. typedef unordered_set<int> si;
  17. typedef unordered_set<long long> sll;
  18. typedef unordered_set<string> ss;
  19. typedef unordered_set<char> sc;
  20. typedef map<int,int> ormii;
  21. typedef map<long long,long long> ormll;
  22. typedef map<string,int> ormsi;
  23. typedef map<char,int> ormci;
  24. typedef set<int> orsi;
  25. typedef set<long long> orsll;
  26. typedef set<string> orss;
  27. typedef set<char> orsc;
  28. typedef vector<int> vi;
  29. typedef vector<string> vs;
  30. typedef vector<char> vc;
  31. typedef vector<ll> vll;
  32. typedef vector<vector<int>> vvi;
  33. typedef vector<vector<string>> vvs;
  34. typedef vector<vector<ll>> vvll;
  35.  
  36. #define FOR(i, a, b) for (auto i=a; i<=(b); i++)
  37. #define FORd(i,b,a) for (int i =b; i >= a; i--)
  38. #define sortinc(v)  sort(v.begin(),v.end())
  39. #define sortdec(v)  sort(v.rbegin(),v.rend())
  40. #define sz(x) (int)(x).size()
  41. #define mp make_pair
  42. #define pb push_back
  43. #define pob pop_back
  44. #define pf push_front
  45. #define pof pop_front
  46. #define fi first
  47. #define se second
  48. #define ins insert
  49.  
  50. const int MOD = 1000000007;
  51. int m(ll k) {return k%MOD;}
  52. //type functions here
  53. /*ROD cutting problem given a rod of length n ,with array B of prices from 1 to n when you are  cutting
  54. a length x (x E 1 to n)  your profit will be B[x-1] the goal is to find out the max profit for the given n length rod
  55.  */
  56.  
  57.  
  58. int cut_rod(int len,vi &B)
  59. {
  60.    vvi dp(len+1,vi(len+1,0));
  61.    FOR(i,0,len) dp[0][i]=0;
  62.    FOR(i,0,len) dp[i][0]=0;
  63.    FOR(i,1,len)
  64.    {
  65.        FOR(j,1,len)
  66.      {
  67.      if(i<=j)
  68.      dp[i][j]=max(dp[i][j-i]+B[i-1],dp[i-1][j]);
  69.      else
  70.        dp[i][j]=dp[i-1][j];
  71.     }
  72.    }
  73.    
  74.     return dp[len][len];
  75. }
  76. int main() {
  77.     ios_base::sync_with_stdio(false);
  78.     cin.tie(NULL);
  79.    
  80.     int tc=1;
  81.     //cin>>tc;
  82.     FOR(w,1,tc)
  83.     {
  84.        vi B={4,5,1,0};
  85.        cout<<cut_rod(sz(B),B)<<endl;
  86.     }
  87.     return 0;
  88. }
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95.  
  96.  
  97.  
  98.  
  99.  
  100.  
  101.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement