-
Notifications
You must be signed in to change notification settings - Fork 2
/
Burst Balloons
52 lines (39 loc) · 1.04 KB
/
Burst Balloons
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
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int f(int i, int j, vector<int>& arr, vector<vector<int>>& dp) {
if(i > j) return 0;
if(dp[i][j] != -1) return dp[i][j];
int ans = INT_MIN;
for(int ind = i; ind <= j; ind++) {
int cost = (arr[i-1] * arr[ind] * arr[j+1]) + f(i, ind-1, arr, dp) + f(ind+1, j, arr, dp);
ans = max(ans, cost);
}
return dp[i][j] = ans;
}
int maxCoins(int n, vector<int> &arr) {
arr.push_back(1);
arr.insert(arr.begin(), 1);
vector<vector<int>> dp(n+1, vector<int>(n+1, -1));
return f(1, n, arr, dp);
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int N;
cin>>N;
vector<int> arr(N);
for(int i=0; i<N; i++)
cin>>arr[i];
Solution obj;
cout << obj.maxCoins(N, arr) << endl;
}
return 0;
}
// } Driver Code Ends