<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) {
        vector<pair<int, int>> shrink;
        shrink.push_back({boxes[0],1});
        for (auto i = 1; i < boxes.size(); i++){
            if (boxes[i] == boxes[i-1]) shrink[shrink.size()-1].second++;
            else shrink.push_back({boxes[i], 1});
        }

        vector<vector<vector<int>>> dp(shrink.size()+1, vector<vector<int>> (shrink.size()+1, vector<int> (101, -1)));
        auto game = [&](auto left, auto right, auto rem, auto&& game){
            if (left >= right or left < 0 or right > shrink.size()) return rem*rem;
            //cout << left << " " << right << " " << rem << "\n";
            if (dp[left][right][rem] != -1) return dp[left][right][rem];
            auto mx = game(left+1, right, 0, game) + (rem+shrink[left].second)*(rem+shrink[left].second);
            for (auto i = left+1; i < right; i++){
                if (shrink[i].first == shrink[left].first) {
                    mx = max(mx, game(left+1, i, 0, game) + game(i, right, rem+shrink[left].second, game));
                }
            }
            return dp[left][right][rem] = mx;
        };
        return game(0, shrink.size(), 0, game);
    }
};
56134