<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 {
    int solve(vector<pair<int,int>> &boxes, int l ,int r,int extra, auto &dp)
    {

        if(l>r)
        {
            return 0;
        }
        if(dp[l][r][extra]!=-1)
            return dp[l][r][extra];
        int maxx = solve(boxes,l+1,r,0,dp)+pow(boxes[l].second+extra,2);
        
        for(int k = l+1 ; k<=r; k++)
        {
            int temp = 0;
            if(boxes[k].first == boxes[l].first)
            {
                temp =  solve(boxes,l+1,k-1,0,dp) + solve(boxes,k,r,boxes[l].second+extra,dp);
            }
            maxx = max(maxx,temp);
        }

        return dp[l][r][extra]=maxx;
    }
public:
    int removeBoxes(vector<int>& boxes) {
        
        int n = boxes.size();
        vector<pair<int,int>> boxes2;
        int count = 0 ;
        int val = -1;
        for(int i= 0 ; i< n ; i++)
        {
            if(val==-1)
            {
                val = boxes[i];
                count = 1;
                continue;
            }
            if(val==boxes[i])
            {
                count++;
            }
            else
            {
                boxes2.push_back({val,count});
                val = boxes[i];
                count = 1; 
            }
        }
        boxes2.push_back({val,count});

        n = boxes2.size();
        vector<vector<vector<int>>> dp(n+1,vector<vector<int>>(n+1,vector<int>(100,-1)));
        // boxes.insert(boxes.begin(),0);

        // boxes.push_back(0);
        return solve(boxes2,0, n-1,0,dp);
    }
};
54785