ACM3-1005
2016-05-28 09:02
375 查看
Problem E
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 94 Accepted Submission(s) : 50
Problem Description
A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monkey is clever enough, it shall be able to reach the banana
by placing one block on the top another to build a tower and climb up to get its favorite food.<br><br>The researchers have n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions
(xi, yi, zi). 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. <br><br>They want to make sure that the tallest tower possible by stacking blocks can reach the
roof. The problem is 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 because there
has to be some space for the monkey to step on. This meant, for example, that blocks oriented to have equal-sized bases couldn't be stacked. <br><br>Your job is to write a program that determines the height of the tallest tower the monkey can build with a
given set of blocks.<br>
Input
The input file will contain one or more test cases. The first line of each test case contains an integer n,<br>representing the number of different blocks in the following data set. The maximum value for n is 30.<br>Each of the next n lines contains three integers
representing the values xi, yi and zi.<br>Input is terminated by a value of zero (0) for n.<br>
Output
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".<br>
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 #include #include #include #include #include #include using namespace std; #define maxf(a,b) a>b?a:b const int inf=0x3f3f3f3f; struct node { int l,w,h; } b[1000]; bool cmp(node a, node b) { if(a.l==b.l) return a.w>b.w; return a.l>b.l; } int main() { int t,fff=1; while(~scanf(%d,&t)&&t) { int j=0,a[4]; for(int i=0; i=0; i--) { for(int k=i+1; kb[k].l&&b[i].w>b[k].w) dp[i]=dp[i]>dp[k]+b[i].h?dp[i]:dp[k]+b[i].h; } max1=dp[i]>max1?dp[i]:max1; } printf(Case %d: maximum height = %d ,fff++,max1); } }
相关文章推荐
- 动态生成验证码
- 发展人工智能,中国先于美国一步有何证据?
- android 解析服务器数据使用json还是xml方式
- android 解析服务器数据使用json还是xml方式
- iOS之自动释放原理
- moon 2016.05.27
- Windows下使用Redis(一)安装使用
- java入门教程-11.7Java图像缓冲技术
- 易语言基础教程之条件选择结构
- java入门教程-11.6Java图像处理基础
- ACM3-1003
- 设计模式学习笔记--观察者模式
- java入门教程-11.5Java Graphics2D类的绘图方法
- Failed to load the JNI shared library jvm.dll
- 第二阶段站立会议第二天
- java入门教程-11.4Java Graphics类的绘图方法
- NYIST 737-石子合并(区间DP)
- 如何修改FireFox火狐浏览器的首选语言设置
- Centos6.5安装docker及docker基础命令
- HDU1865 1sting