<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[222][222][222];
    int solve(int l, int r, vector<int> &b, int count){
        if(l > r)
            return 0;

        if(dp[l][r][count] != -1)
            return dp[l][r][count];

        int ans = (count+1) * (count+1) + solve(l+1, r, b, 0);
        for(int k = l + 1; k<=r; k++){
            if(b[k] == b[l]){
                //           continue with prev cnt   inbetween range
                ans = max(ans, solve(k,r,b,count+1) + solve(l+1,k-1,b,0));
            }
        }
        return dp[l][r][count]=ans;
    }
    int removeBoxes(vector<int>& b) {
        int n = b.size();
        memset(dp, -1, sizeof(dp));
        return solve(0, n-1, b, 0);
    }
};
38600