<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 find(int st,int en,int k,vector<vector<int>>&v,vector<vector<vector<int>>>&dp)
    {
        if(st>en) return 0;
        if(dp[st][en][k]!=0) return dp[st][en][k];
        int ans=find(st,en-1,0,v,dp)+(v[en][1]+k)*(v[en][1]+k);
        for(int i=en-1;i>=st;i--)
        {
            if(v[i][0]==v[en][0])
            {
                int temp=find(st,i,k+v[en][1],v,dp)+find(i+1,en-1,0,v,dp);
                ans=max(ans,temp);
            }
        }
        return dp[st][en][k]=ans;
    }
public:
    int removeBoxes(vector<int>& v) {
        int cnt=1;
        vector<vector<int>>p;
        int last=v[0];
        for(int i=1;i<v.size();i++)
        {
            if(v[i]!=last)
            {
                p.push_back({last,cnt});
                cnt=1;
                last=v[i];
            }
            else cnt+=1;
        }
        p.push_back({last,cnt});
        int n=p.size();
        vector<vector<vector<int>>>dp(n+1,vector<vector<int>>(n+1,vector<int>(v.size()+1,0)));
        return find(0,n-1,0,p,dp);

    }
};
49390