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

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
Dynamic Programming/Cut Rod.cpp
View File

@@ -5,25 +5,24 @@ the pieces.*/
#include <bits/stdc++.h>
using namespace std;
int cutrod(int p[],int n)
int cutrod(int p[], int n)
{
int r[n+1];
r[0]=0;
for(int j=0;j<n;j++)
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++)
int q = INT_MIN;
for (int i = 0; i <= j; i++)
{
q = max(q,p[i]+r[j-i]);
q = max(q, p[i] + r[j - i]);
}
r[j+1]=q;
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);
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;
}