<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 removeBoxes(self, boxes: List[int]) -> int:
        length = len(boxes)
        dp = [[[0 for _ in range(length)] for _ in range(length)]
              for _ in range(length)]
        for i in range(length):
            for j in range(length-i):
                dp[i][i][j] = (1+j)*(1+j)
        for r in range(1, length):
            for i in range(length):
                if i+r >= length:
                    continue
                for j in range(length - i-r):
                    value = dp[i][i+r-1][0] + (1+j)*(1+j)
                    for k in range(i, i+r):
                        if boxes[k] == boxes[i+r]:
                            value = max(value, dp[i][k][j+1] + dp[k+1][i+r-1][0])
                    dp[i][i+r][j] = value

        return dp[0][length-1][0]
30600