<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>

#define ll long long
const ll N =105;
class Solution {
ll dp[N][N][N];

ll f(ll i,ll j,ll taken,vector<pair<ll,ll>>&box,ll n){
   if(i>j){
    return 0;
   }
   if(dp[i][j][taken]!=-1){
    return dp[i][j][taken];
   }
   ll sz = box[i].second;
   ll color = box[i].first;
   ll ans = (taken+sz)*(taken+sz) +f(i+1,j,0,box,n);
   for(ll p=i+1;p<=j;p++){
    if(box[i].first==box[p].first){
        ans = max(ans,f(p,j,taken+sz,box,n)+f(i+1,p-1,0,box,n));
    }
   }
   return dp[i][j][taken]=ans;
}
public:
    int removeBoxes(vector<int>& boxes) {
        ll n = boxes.size();
        memset(dp,-1,sizeof(dp));
        vector<pair<ll,ll>>box;
        ll cnt =0;
        for(int i=1;i<n;i++){
            cnt++;
          if(boxes[i]!=boxes[i-1]){
            box.push_back({boxes[i-1],cnt});
            cnt =0;
          }

        }
        box.push_back({boxes[n-1],cnt+1});
        // for(auto&a:box){
        //     cout<<a.first<<" "<<a.second<<endl;
        // }
        ll m = box.size();
        ll ans = f(0,m-1,0,box,m);
        return ans;

    }
};
19718