<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 func(int i, int j, int k, vector<vector<int>>& v, vector<vector<vector<int>>>& dp){
        if(i>j){
            return 0;
        }
        if(dp[i][j][k]!=-1){
            return dp[i][j][k];
        }
        int c=v[i][0];
        int sz=v[i][1];
        int steps=(k+sz)*(k+sz)+func(i+1,j,0,v,dp);
        for(int g=i+1;g<=j;g++){
            if(v[g][0]==c)
            steps=max(steps,func(i+1,g-1,0,v,dp)+func(g,j,k+sz,v,dp));
        }
        return dp[i][j][k]=steps;
    }
    int removeBoxes(vector<int>& b) {
        int n=b.size();
        vector<vector<int>>v;
        v.push_back({b[0],1});
        for(int i=1;i<n;i++){
            if(v.back()[0]==b[i]){
                int a=v.back()[1];
                v.pop_back();
                v.push_back({b[i],a+1});
            }
            else{
                v.push_back({b[i],1});
            }
        }
        vector<vector<vector<int>>> dp(n+1,vector<vector<int>>(n+1,vector<int>(n+1,-1)));
        return func(0,v.size()-1,0,v,dp);
    }
};
79063