<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 solve(int i,int l,vector<vector<int>>&trunc,int extra,vector<vector<vector<int>>>&dp){
        if(i>l) return 0;
        if(dp[i][l][extra]!=-1) {
            
            return dp[i][l][extra];
        }
        int answer = (trunc[i][0]+extra)*(trunc[i][0]+extra) + solve(i+1,l,trunc,0,dp);
        for(int j=i+1;j<=l;j++){
            if(trunc[i][1]==trunc[j][1]) {
                answer = max(answer, solve(i+1,j-1,trunc,0,dp)+solve(j,l,trunc,extra+trunc[i][0],dp));
                // break;
            }
        }
        // cout<<i<<" "<<l<<" "<<answer<<endl;
        return dp[i][l][extra]=answer;
    }
    int removeBoxes(vector<int>& boxes) {
        int n=boxes.size(),i=0;
        vector<vector<int>>trunc;
        while(i<n){
            int j=i,count=0;
            while(j<n && boxes[j]==boxes[i]) j++,count++;
            trunc.push_back({count,boxes[i]});
            i=j;
        }
        n=trunc.size();
        vector<vector<vector<int>>>dp(n,vector<vector<int>>(n,vector<int>(boxes.size()+1,-1)));
        return solve(0,n-1,trunc,0,dp);
    }
};
43995