-
Notifications
You must be signed in to change notification settings - Fork 1
/
Rod_cutting(Memorisation).cpp
55 lines (55 loc) · 1.05 KB
/
Rod_cutting(Memorisation).cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fr(i,n) for(int i=0;i<n;i++)
#define fre(i,a,b) for(int i=a;i<=b;i++)
#define endl '\n'
#define no cout << "NO" << endl
#define yes cout << "YES" << endl
#define mem(name, value) memset(name, value, sizeof(name))
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define case cout << "Case " << t++ << ": ";
int cut_rod(int *arr, int n)
{
int dp[n] = {0};
if (n == 0) {
return 0;
}
if (dp[n] != 0) {
return dp[n];
}
int ans;
int pro = 0;
fr(i, n) {
ans = arr[i] + cut_rod(arr, n - i);
pro = max(pro, ans);
}
return dp[n] = pro;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin) ;
freopen("output.txt", "w", stdout);
#endif
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int p[n];
fr(i, n) {
cin >> p[i];
}
cout << cut_rod(p, n ) << endl;
}
return 0;
}