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

Update cut_rod.cpp

Browse Source
This commit is contained in:
ABHISHEK-821005 2020-10-31 11:46:30 +05:30 committed by GitHub
parent 063e36922b
commit 6556e0da3c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
dynamic_programming/cut_rod.cpp
View File

@ -71,11 +71,11 @@ int maxProfitByCuttingRod(const std::array<int, T> &price, const uint64_t &n) {
static void test() {
// Test 1
const int16_t n1 = 8; // size of rod
std::array<int32_t, n1> price1 = {1,2,4,6,8,45,21,9}; // price array
const int64_t max_profit1 =
std::array<int32_t, n1> price1 = {1,2,4,6,8,45,21,9}; // price array
const int64_t max_profit1 =
dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1);
const int64_t expected_max_profit1 = 47;
assert(max_profit1 == expected_max_profit1);
const int64_t expected_max_profit1 = 47;
assert(max_profit1 == expected_max_profit1);
std::cout << "Maximum profit with " << n1 << " inch road is " << max_profit1
<< std::endl;
@ -86,10 +86,10 @@ static void test() {
31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 49, 50};
const int64_t max_profit2=
const int64_t max_profit2=
dynamic_programming::cut_rod::maxProfitByCuttingRod(price2, n2);
const int32_t expected_max_profit2 = 90;
assert(max_profit2 == expected_max_profit2);
const int32_t expected_max_profit2 = 90;
assert(max_profit2 == expected_max_profit2);
std::cout << "Maximum profit with " << n2 << " inch road is " << max_profit2
<< std::endl;
}