<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 {
public:
    int removeBoxes(vector<int>& boxes) {
        int n = boxes.size();
        if(n == 0)
            return 0;
        int dp[100][100][100];
        for(int i = 0; i < n; i++)
        {
            for(int k = 0; k < n; k++)
            {
                if(i > 0)
                    dp[i][i - 1][k] = 0;
                dp[i][i][k] = (k + 1) * (k + 1);
            }
        }
        for(int l = 2; l <= n; l++)
        {
            for(int j = l - 1; j < n; j++)
            {
                int i = j - l + 1;
                for(int k = 0; k <= i; k++)
                {
                    // take current box
                    int res = (k + 1) * (k + 1) + dp[i + 1][j][0];
                    for(int m = i + 1; m <= j; m++)
                    {
                        // merge with mth box
                        if(boxes[m] == boxes[i])
                            res = max(res, dp[i + 1][m - 1][0] + dp[m][j][k + 1]);
                    }
                    dp[i][j][k] = res;
                }
            }
        }
        return dp[0][n - 1][0];
    }
};
12974