<p>You are given several <code>boxes</code> with different colors represented by different positive numbers.</p>

<p>You may experience several rounds to remove boxes until there is no box left. Each time you can choose some continuous boxes with the same color (i.e., composed of <code>k</code> boxes, <code>k &gt;= 1</code>), remove them and get <code>k * k</code> points.</p>

<p>Return <em>the maximum points you can get</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> boxes = [1,3,2,2,2,3,4,3,1]
<strong>Output:</strong> 23
<strong>Explanation:</strong>
[1, 3, 2, 2, 2, 3, 4, 3, 1] 
----&gt; [1, 3, 3, 4, 3, 1] (3*3=9 points) 
----&gt; [1, 3, 3, 3, 1] (1*1=1 points) 
----&gt; [1, 1] (3*3=9 points) 
----&gt; [] (2*2=4 points)
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> boxes = [1,1,1]
<strong>Output:</strong> 9
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> boxes = [1]
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= boxes.length &lt;= 100</code></li>
	<li><code>1 &lt;= boxes[i]&nbsp;&lt;= 100</code></li>
</ul>

class Solution {
public:
    int dp[100][100][100][3];
    int n;
    int solve(int start, int end, int cnt, int fl, vector<int> &nums){
        if(start > end) return cnt * cnt;
        int prev = -1;
        if(fl == 0)  prev = nums[start - 1];
        else if(fl == 1) prev = nums[end + 1];
        if(start == end){
            if(nums[start] == prev) return (cnt+1) * (cnt+1);
            return 1 + (cnt * cnt);
        }
        if(dp[start][end][cnt][fl] !=  -1) return dp[start][end][cnt][fl];
        int ans = 0;
        for(int k=start ; k <= end; k++){
            if(nums[k] == prev){
                ans = max(ans, solve(start, k-1, 0, 2, nums) + solve(k+1, end, cnt+1, 0, nums));
            }
            else{
                ans = max(ans, cnt * cnt + solve(start, k-1, 0, 2, nums) + solve(k+1, end, 1, 0, nums));
            }
        }
        cout<< ans << " " << start << " "; cout << endl; 
        return dp[start][end][cnt][fl] = ans;
    }
    int removeBoxes(vector<int>& boxes) {
        n = boxes.size();
        memset(dp, -1, sizeof(dp));
        return solve(0, n-1, 0, 2, boxes);
    }
};
21066