312. Burst Balloons[hard]

Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and right are adjacent indices of i. After the burst, the left and right then becomes adjacent.

Find the maximum coins you can collect by bursting the balloons wisely.

Note: 
(1) You may imagine nums[-1] = nums[n] = 1. They are not real therefore you can not burst them.
(2) 0 ≤ n ≤ 500, 0 ≤ nums[i] ≤ 100

Example:

Given [3, 1, 5, 8]

Return 167

    nums = [3,1,5,8] --> [3,5,8] -->   [3,8]   -->  [8]  --> []
   coins =  3*1*5      +  3*5*8    +  1*3*8      + 1*8*1   = 167

dp题

设dp[i][j]为戳爆第i到第j个气球所能得到的分数最大值

有 dp[i][j] = max(dp[i][j] , dp[i][k-1] + dp[k+1][j] + nums[k]*nums[i-1]*nums[j+1] ); (i<=k<=j)

class Solution {
public:
    int maxCoins(vector<int>& nums)
    {
        int L = nums.size();
        nums.insert(nums.begin(), 1);
        nums.push_back(1);        
        int dp[L+2][L+2]={0};
        
        for(int len = 1; len<=L;++len)
        {
            for(int i = 1 ; i <= L - len + 1 ; ++i)
            {
                int j = i + len - 1;
                for(int k = i ; k <= j ; ++k)
                    dp[i][j] = max( dp[i][j] , nums[k]*nums[i-1]*nums[j+1] + dp[i][k-1] + dp[k+1][j] );
            }
        }
        
        return dp[1][L];
    }
};