312. Burst Balloons（动规+ 分治）

1.题目秒是

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

2.算法

思想：解题的重点寻找分治的切入点，仔细分析题目可以发现，第一个被选中执行burst操作的气球就是分治的切入点，选择不同的第一个burst的气球得到的结果可能是一样的，所以最大的结果只要选遍每一个开始burst的气球，从中计算最大值。选择第一个burst的气球后，剩余的气球实际上可以分为两半处理，这就是本题分治算法的核心。对每一半都执行类似上述的分治操作，那么就可以递归计算所有可能的burst方案及其对应的结果。

class Solution {
public:
    int maxCoins(vector<int>& nums) {

        vector<int> AugmentedNums;
        AugmentedNums.push_back(1);
        //剔除所有0元素，我们计算过程会避开这些0，因为0的参与无助于最大coins 
        for(auto& num : nums) {
            if(num) AugmentedNums.push_back(num);
        }
        AugmentedNums.push_back(1);

        int n = AugmentedNums.size() - 2;
        //dp[start][end]表示从[start, end]这个区间开始busrt可以获得最大的coins
        // start >= 1, end <= n 
        vector<vector<int>> dp(n+1, vector<int>(n+1, -1));
        return recur_maxCoins(1, n, AugmentedNums, dp); 
    }
    int recur_maxCoins(int start, int end, vector<int>& nums, vector<vector<int>>& dp) {
        //epmty 
        if(start > end) return 0;
        //computed already 
        if(dp[start][end] != -1)
            return dp[start][end];
        //only one
        if(start == end) {
            dp[start][end] = nums[start-1]*nums[start]*nums[start+1];
            return dp[start][end];
        }

        /*
         * for every one element e between start and end
         * compute recur_maxCoins(start, e-1, nums, dp) as the left part of nums[e]
         * compute recur_maxCoins(e+1, end, nums. dp) as the right part of nums[e]
         * the sum of above two parts plus nums[start-1]*nums[lastBurst]*nums[end+1] 
         * will be the resulting coins of this recursivision
         */
         for(int selected = start; selected <= end; ++selected) {
            dp[start][end] = max(dp[start][end],
                                nums[start-1]*nums[selected]*nums[end+1] + 
                                 recur_maxCoins(start, selected-1, nums, dp) + 
                                 recur_maxCoins(selected+1, end, nums, dp)
                                );  
         }
         return dp[start][end];
    }
};