题目链接
http://acm.hdu.edu.cn/showproblem.php?pid=1069
题意
给定n个长方体,每个长方体的数目是无限的,对于任意两个长方体A, B, 满足A.x > B.x && A.y > B.y,那么B就可以放在A的上面,求这些长方体能够堆起的最大高度
思路
DAG上的最长路,对于任意两个长方体,如果满足嵌套条件,就是图中的一条边,求源点固定的最长路
最开始考虑的是每个长方体看做一个点,一共就有n + 1(源点)个点,但是实际上每个长方体可能被用多次,因为每个长方体一共有6种情况,因为应该将每个长方体抽象为n * 6个点(三个点也可以),代表每种情况,然后再dp求DAG上的最长路
转移方程: d[i] = max(d[j] + node[j].z); 其中i能够嵌套j
然后还要注意的一点就是虽然每个长方体的数目是无限的,但是长方体的6种情形,每种情况最多使用一次
代码
#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;
#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)
#define pr(x) cout << #x << " = " << x << endl
#define lc o << 1
#define rc o << 1 | 1
#define pl() cout << endl
const int maxn = 200;
const int INF = 0x3e3e3e3e;
int d[maxn], n, kase = 0;
struct Block {
int x, y, z;
void swap1() {
swap(x, z);
}
void swap2() {
swap(y, z);
}
void swap3() {
swap(x, y);
}
} node[maxn];
bool judge(int i, int j) {
return node[i].x > node[j].x && node[i].y > node[j].y;
}
int dp(int u) {
if (d[u] >= 0) return d[u];
d[u] = 0;
for (int v = 0; v <= n; v++) {
if (judge(u, v)) d[u] = max(d[u], dp(v) + node[v].z);
}
return d[u];
}
int main() {
int t1, t2, t3;
while (scan(n) && n) {
memset(d, -1, sizeof(d));
n *= 6;
for (int i = 1; i <= n; i += 6) {
scan3(t1, t2, t3);
for (int j = 0; j < 6; j++) {
node[i + j].x = t1;
node[i + j].y = t2;
node[i + j].z = t3;
}
node[i + 1].swap1();
node[i + 2].swap2();
node[i + 3].swap3();
node[i + 4].swap1(), node[i + 4].swap2();
node[i + 5].swap3(), node[i + 5].swap2();
}
node[0].x = node[0].y = node[0].z = INF;
printf("Case %d: maximum height = %d\n", ++kase, dp(0));
}
return 0;
}