<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:
    def maxi(self,left,right,s,boxes,dp):
        if left>right:
            return 0
        if dp[left][right][s]!=-1:
            return dp[left][right][s]
        ans=(s+1)*(s+1)+self.maxi(left+1,right,0,boxes,dp)
        for i in range(left+1,right+1):
            if boxes[i]==boxes[left]:
                ans=max(ans,self.maxi(left+1,i-1,0,boxes,dp)+self.maxi(i,right,s+1,boxes,dp))
        dp[left][right][s]=ans
        return ans
    def removeBoxes(self, boxes: List[int]) -> int:
        n=len(boxes)
        dp=[[[-1 for i in range(n+1)] for i in range(n+1)]for i in range(n+1)]
        return self.maxi(0,n-1,0,boxes,dp)
30900