UVa 437 The Tower of Babylon(动态规划)
来源:互联网 发布:公司网络布局 编辑:程序博客网 时间:2024/05/20 19:28
The Tower of Babylon
Perhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line with the educational nature of this contest, we will tell you the whole story:
The babylonians had n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions . A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height. They wanted to construct the tallest tower possible by stacking blocks. The problem was that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block. This meant, for example, that blocks oriented to have equal-sized bases couldn't be stacked.
Your job is to write a program that determines the height of the tallest tower the babylonians can build with a given set of blocks.
Input and Output
The input file will contain one or more test cases. The first line of each test case contains an integer n, representing the number of different blocks in the following data set. The maximum value for n is 30. Each of the next n lines contains three integers representing the values , and .
Input is terminated by a value of zero (0) for n.
For each test case, print one line containing the case number (they are numbered sequentially starting from 1) and the height of the tallest possible tower in the format "Case case: maximum height = height"
Sample Input
110 20 3026 8 105 5 571 1 12 2 23 3 34 4 45 5 56 6 67 7 7531 41 5926 53 5897 93 2384 62 6433 83 270
Sample Output
Case 1: maximum height = 40Case 2: maximum height = 21Case 3: maximum height = 28Case 4: maximum height = 342
题意 给你n种长方体 每种都有无穷个 当一个长方体的长和宽都小于另一个时 这个长方体可以放在另一个上面 要求输出这样累积起来的最大高度
因为每个长方体都有3种放法 比较不好控制 可以把一个长宽高分成三个长方体 高度是固定的 这样就比较好控制了;
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define maxn 105int x[maxn], y[maxn], z[maxn], d[maxn], n;int dp(int i){ if(d[i] > 0) return d[i]; d[i] = z[i]; for(int j = 1; j <= n; ++j) { if((x[i] > x[j] && y[i] > y[j]) || (x[i] > y[j] && y[i] > x[j])) d[i] = max(d[i], dp(j) + z[i]); } return d[i];}int main(){ int a, b, c, cas = 1; while (scanf("%d", &n), n) { n *= 3; for(int i = 1; i <= n;) { scanf("%d%d%d", &a, &b, &c); x[i] = a; y[i] = b; z[i++] = c; x[i] = a; y[i] = c; z[i++] = b; x[i] = b; y[i] = c; z[i++] = a; } int ans = 0; memset(d, 0, sizeof(d)); for(int i = 1; i <= n; ++i) ans = max(dp(i), ans); printf("Case %d: maximum height = %d\n", cas, ans); cas++; } return 0;}
- 动态规划 DAG问题uva 437 The Tower of Babylon
- UVa 437 The Tower of Babylon(动态规划)
- UVa 437 - The Tower of Babylon(DAG动态规划)
- 【动态规划】[UVA 437]The Tower of Babylon
- uva 动态规划 437 The Tower of Babylon
- 【动态规划】UVa 437 The Tower of Babylon
- UVA 437 The Tower of Babylon (动态规划)
- The Tower of Babylon DAG上的动态规划+uva
- UVA437 The Tower of Babylon 动态规划
- [动态规划]UVA437 - The Tower of Babylon
- UVA437 - The Tower of Babylon - 动态规划
- uva 437 The Tower of Babylon(动态规划 嵌套矩形问题最长路)
- UVA 437 The Tower of Babylon(DAG上的动态规划)
- UVA 437 The Tower of Babylon 巴比伦塔(DAG上的动态规划)
- 437 - The Tower of Babylon(动态规划)
- uva 437 The Tower of Babylon
- UVa 437 - The Tower of Babylon
- UVA 437 The Tower of Babylon
- Net Remoting(应用程序域)
- 哈夫曼树
- 设计自己的基于Selenium 的自动化测试框架-Java版(2) - 定义自己的工作流程
- gluster 添加xlator新节点
- 8.asm-PEB、TEB的地址(ntdll!RtlGetCurrentPeb得到PEB)
- UVa 437 The Tower of Babylon(动态规划)
- Linux系统常用快捷键
- RHEL5.5_x86_64上安装ASE12.5.4
- 异或树
- 一人点赞,N人跟风?
- workBench 下工程创建时通过快捷方式添加其他位置的文件夹
- ArcGIS教程:欧氏距离——空间分析
- JSP输出
- 如何使用 iOS 7 的 AVSpeechSynthesizer 制作有声书(1)