poj1390 Blocks

$题目传送门poj1390$

---

题目

$Blocks$

$Time Limit: 5000MS$
$Memory Limit: 65536K$
$Total Submissions: 6118$
$Accepted: 2523$

$Description$

Some of you may have played a game called ‘Blocks’. There are n blocks in a row, each box has a color. Here is an example: Gold, Silver, Silver, Silver, Silver, Bronze, Bronze, Bronze, Gold.
The corresponding picture will be as shown below:

If some adjacent boxes are all of the same color, and both the box to its left(if it exists) and its right(if it exists) are of some other color, we call it a ‘box segment’. There are 4 box segments. That is: gold, silver, bronze, gold. There are 1, 4, 3, 1 box(es) in the segments respectively.

Every time, you can click a box, then the whole segment containing that box DISAPPEARS. If that segment is composed of k boxes, you will get k*k points. for example, if you click on a silver box, the silver segment disappears, you got 4*4=16 points.

Now let’s look at the picture below:

The first one is OPTIMAL.

Find the highest score you can get, given an initial state of this game.

$Input$

The first line contains the number of tests t(1<=t<=15). Each case contains two lines. The first line contains an integer n(1<=n<=200), the number of boxes. The second line contains n integers, representing the colors of each box. The integers are in the range 1~n.

$Output$

For each test case, print the case number and the highest possible score.

$Sample Input$

2
9
1 2 2 2 2 3 3 3 1
1
1

$Sample Output$

Case 1: 29
Case 2: 1

---

题解

这道题是一道看起来很简单的难题。
由于贪心，我们可以发现：颜色一样位置相邻的块可以直接合并，预处理掉即可。
然后我们设计状态：$f[i][j]$表示$i$到$j$合并后的最大分数，但是我们发现无法转移，因为存在多段颜色都一样位置不相邻的块合并的情况。
所以我们需要重新设计状态：$f[i][j][k]$表示$i$到$j$，并且在$j$位置中加长颜色相同的$k$块，合并后的最大分数。
这样就容易转移了：
$1.$如果$j$自己合并，那么$f[i][j][k] = f[i][j - 1][0] + (len[j] + k) ^ 2$。
$2.$如果$j$与别人合并，那么枚举与$j$一起合并的别人$p$，$f[i][j][k] = max(f[p + 1][j - 1][0] + f[i][p][len[j] + k])$，$i \leq p < j$且$col[p] = col[j]$。
这样就完美解决了。

---

标程

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int N = 250;

int main() {
    int t; cin >> t;
    static int f[N][N][N];
    static int n, m, c[N], d[N], e[N];
    for (int tt = 1; tt <= t; tt++) {
        cin >> n; m = 0; e[0] = n;
        memset(d, 0, sizeof d);
        for (int x, i = 1; i <= n; i++) {
            cin >> x;
            if (x != c[m]) {
                c[++m] = x;
                e[m] = e[m - 1];
            }
            d[m]++; e[m]--;
        }
        for (int i = m; i; i--) {
            for (int j = i; j <= m; j++) {
                for (int k = 0; k <= e[j]; k++) {
                    f[i][j][k] = f[i][j - 1][0] + (d[j] + k) * (d[j] + k);
                    for (int l = i; l < j; l++) {
                        if (c[j] != c[l]) continue;
                        f[i][j][k] = max(f[i][j][k], f[i][l][d[j] + k] + f[l + 1][j - 1][0]);
                    }
                }
            }
        }
        cout << "Case " << tt << ": " << f[1][m][0] << endl;
    }
    return 0;
}

---