uva437
来源:互联网 发布:张韶涵 范玮琪 知乎 编辑:程序博客网 时间:2024/05/02 22:12
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-iblock 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
1
10 20 30
2
6 8 10
5 5 5
7
1 1 1
2 2 2
3 3 3
4 4 4
5 5 5
6 6 6
7 7 7
5
31 41 59
26 53 58
97 93 23
84 62 64
33 83 27
0
Sample Output
Case 1: maximum height = 40
Case 2: maximum height = 21
Case 3: maximum height = 28
Case 4: maximum height = 342
分析:在任何时候顶部的尺寸会影响后面的决策,每个立方体的三条边之一都可以作为高,其余可以作为顶
先按照顶部的面积排序,然后动态规划,原理和求最长上升(下降)子序列方法类似
#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<vector>#include<stack>#include<queue>#include<map>#include<set>#include<algorithm>using namespace std;struct stu{ int x,y,z; void f(int a,int b,int c){ x=a; y=b; z=c; }}cube[200];bool cmp(struct stu a,struct stu b){ return a.x*a.y<b.x*b.y;}int dp[200];int main(){ int n; int i,j,k; int m; int a,b,c; int Max; int kase=0; while(~scanf("%d",&n)&&n!=0){ m=0; for(i=0;i<n;i++){ scanf("%d %d %d",&a,&b,&c); cube[m++].f(a,b,c); cube[m++].f(a,c,b); cube[m++].f(b,a,c); cube[m++].f(b,c,a); cube[m++].f(c,b,a); cube[m++].f(c,a,b); } sort(cube,cube+m,cmp); Max=0; for(i=0;i<m;i++){ dp[i]=cube[i].z; for(j=0;j<i;j++){ if(cube[i].x>cube[j].x&&cube[i].y>cube[j].y){ dp[i]=max(dp[i],dp[j]+cube[i].z); } } if(Max<dp[i]) Max=dp[i]; } printf("Case %d: maximum height = %d\n",++kase,Max); memset(dp,0,sizeof(dp)); } return 0;}
- uva437
- UVa437
- uva437
- uva437
- UVA437
- UVA437
- UVa437
- uva437
- UVA437(DP)
- uva437 DAG
- [DP] UVA437
- uva437(经典DAG题目)
- uva437 动态规划
- UVa1025/UVa437/UVa1347
- uva437 巴比伦塔
- uva437 DAG最长路
- UVA437- - The Tower of Babylon
- UVa437 The Tower of Babylon
- 简介
- timeit
- 顺序查找树
- c语言基础内容——一些基础内容(完节)
- 【JS】下拉框的基本操作
- uva437
- java中运行一段代码所需时间实现方式
- js系统函数
- 最短路径基本介绍(1)--Floyd算法(多源最短路径,五行代码)
- CentOS7下安装Redis
- 注重实效的程序员之快速参考指南
- 五、Swift Alamofire入门
- 经典加密算法 - DES
- 山科大 oj 小学生算术题