OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add cut rod problem

Browse Source
This commit is contained in:
pkdism 2016-12-01 19:44:32 +05:30
parent 836d6a055a
commit 233a88078e
1 changed files with 29 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
Dynamic Programming/Cut Rod.cpp Normal file
View File

@ -0,0 +1,29 @@
/*Given a rod of length n inches and an array of prices that
contains prices of all pieces of size smaller than n. Determine
the maximum value obtainable by cutting up the rod and selling
the pieces.*/
#include <bits/stdc++.h>
using namespace std;
int cutrod(int p[],int n)
{
int r[n+1];
r[0]=0;
for(int j=0;j<n;j++)
{
int q=INT_MIN;
for(int i=0;i<=j;i++)
{
q = max(q,p[i]+r[j-i]);
}
r[j+1]=q;
}
return r[n];
}
int main()
{
int price[]={1,5,8,9,10,17,17,20,24,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50};
cout<<cutrod(price,30);
return 0;
}