题目大意:
给你一些立方体,给出长宽高XYZ。现在希望你将这些立方题叠起来,使得最后的高度最大,并且这些立方体是可以无限次使用的,但是一个立方体要在另一个立方体的上面的话是需要满足这个立方体的底面是可以完全包含在下面的那个立方体的底面。
代码:
DAG最长路:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 31;
struct Node
{
int x, y, z;
Node(int x, int y, int z) :x(x), y(y), z(z) {}
Node() {}
bool operator < (const Node &n)const
{
return (x < n.x&& y < n.y) || (x < n.y&& y < n.x);
}
};
int n;
int d[maxn * 3];
int G[maxn * 3][maxn * 3];
vector<Node> vec;
int dp(int i, int h)//以i开头可以得到的最大高度
{
int & ans = d[i];
if (ans>0)
return ans;
ans = h;
for (int j = 0; j < n * 3; j++)
if (G[i][j])
ans = max(ans, dp(j, vec[j].z) + h);
return ans;
}
int main()
{
int cnt = 0;
while (scanf("%d", &n) == 1 && n)
{
vec.clear();
memset(G, 0, sizeof(G));
memset(d, 0, sizeof(d));
for (int i = 0; i< n; i++)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
vec.push_back(Node(x, y, z));
vec.push_back(Node(x, z, y));
vec.push_back(Node(z, y, x));
}
sort(vec.begin(), vec.end());
for (int i = 0; i < n * 3; i++)
for (int j = 0; j < n * 3; j++)
if (vec[i] < vec[j])
G[i][j] = 1;
int result = -1;
for (int i = 0; i < n * 3; i++)
result = max(result, dp(i, vec[i].z));
printf("Case %d: maximum height = %d\n", ++cnt, result);
}
return 0;
}
LIS:
#include<bits/stdc++.h>
using namespace std;
const int n = 35;
struct block
{
int a;
int b;
int c;
}bk[n * 3];
int n;
int d[n * 3];
int cmp(block a, block b)
{
return a.a * a.b > b.a * b.b;
}
int main()
{
int cas = 1;
while (scanf("%d", &n) && n)
{
int k = 0;
int a, b, c;
for (int i = 0; i < n; i++)
{
scanf("%d%d%d", &a, &b, &c);
bk[k].a = a, bk[k].b = b, bk[k++].c = c;
bk[k].a = a, bk[k].b = c, bk[k++].c = b;
bk[k].a = b, bk[k].b = c, bk[k++].c = a;
}
sort(bk, bk + k, cmp);
int m = 0;
for (int i = 0; i < k; i++)
{
d[i] = bk[i].c;
for (int j = 0; j < i; j++)
{
if (bk[j].a > bk[i].a && bk[j].b > bk[i].b ||bk[j].b > bk[i].a && bk[j].a > bk[i].b)
{
d[i] = d[i] > d[j] + bk[i].c ? d[i] : d[j] + bk[i].c;
}
}
if (d[i] > m)
m = d[i];
}
printf("case %d: maximum height = %d\n", cas++, m);
}
}