backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-07 20:46:16 +08:00
Code Issues Projects Releases Wiki Activity

rename Dynamic Programming -> dynamic_programming (#645)

Browse Source 
* rename Dynamic Programming -> dynamic_programming

* rename dynamic-programming -> dynamic_programming
This commit is contained in:
Christian Clauss
2019-11-28 13:29:01 +01:00
committed by GitHub
parent fc7e416030
commit 5c241487aa
16 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
dynamic_programming/Cut Rod.cpp Normal file
View File

@@ -0,0 +1,28 @@
/*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;
}