题解
根据题意 方块数量无限但自身不能放在自身上 则构成了一个有向无环图 使用dp记忆化搜索递归求解 类似于矩形嵌套 将abc分别作为高度当作节点处理
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e3 + 10;
struct node
{
int x, y, h;
}r[MAXN];
int d[MAXN], m; //以低i个矩形为底座的高度
int dp(int x)
{
if (d[x])
return d[x];
for (int i = 1; i <= m; i++)
if (r[i].x > r[x].x && r[i].y > r[x].y)
d[x] = max(d[x], dp(i));
return d[x] += r[x].h;
}
int main()
{
#ifdef LOCAL
//freopen("C:/input.txt", "r", stdin);
#endif
int n, kase = 1;
while (cin >> n, n)
{
memset(d, 0, sizeof(d));
int a, b, c;
m = 0;
for (int i = 1; i <= n; i++) //转换为以三个长度为高的矩形嵌套
{
scanf("%d%d%d", &a, &b, &c);
r[++m] = node{ max(a, b), min(a, b), c };
r[++m] = node{ max(a, c), min(a, c), b };
r[++m] = node{ max(b, c), min(b, c), a };
}
int ans = 0;
for (int i = 1; i <= m; i++)
ans = max(ans, dp(i));
printf("Case %d: maximum height = %d\n", kase++, ans);
}
return 0;
}