hdu Monkey and Banana(DP)
2017-01-11 09:29
183 查看
Monkey and Banana
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.
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.
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.
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.
Input
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 xi, yi and zi.
Input is terminated by a value of zero (0) for n.
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".
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
思路:类似于最长单调有序子序列
代码:
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.
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.
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.
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.
Input
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 xi, yi and zi.
Input is terminated by a value of zero (0) for n.
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".
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<stdio.h> #include<string.h> #include<algorithm> #define max(a,b) (a>b?a:b) using namespace std; struct node { int x,y,z,dp; } w[1000]; bool cmp(node a,node b) { if(a.x==b.x) return a.y<b.y; return a.x<b.x; } int main() { d724 int m=0,n; while(~scanf("%d",&n),n) { int i,ps=0,j; for(i=0; i<n; i++) { int x,y,z; scanf("%d%d%d",&x,&y,&z); if(x==z) { if(y==z) w[ps].x=x,w[ps].y=y,w[ps].z=w[ps].dp=z,ps++; else { w[ps].x=y,w[ps].y=x,w[ps].z=w[ps].dp=z,ps++; w[ps].x=x,w[ps].y=z,w[ps].z=w[ps].dp=y,ps++; w[ps].x=z,w[ps].y=y,w[ps].z=w[ps].dp=x,ps++; } } else if(x==y) { if(y==z) w[ps].x=x,w[ps].y=y,w[ps].z=w[ps].dp=z,ps++; else { w[ps].x=y,w[ps].y=x,w[ps].z=w[ps].dp=z,ps++; w[ps].x=x,w[ps].y=z,w[ps].z=w[ps].dp=y,ps++; w[ps].x=z,w[ps].y=y,w[ps].z=w[ps].dp=x,ps++; } } else if(y==z) { if(x==y) w[ps].x=x,w[ps].y=y,w[ps].z=w[ps].dp=z,ps++; else { w[ps].x=y,w[ps].y=x,w[ps].z=w[ps].dp=z,ps++; w[ps].x=x,w[ps].y=z,w[ps].z=w[ps].dp=y,ps++; w[ps].x=z,w[ps].y=y,w[ps].z=w[ps].dp=x,ps++; } } else { w[ps].x=y,w[ps].y=x,w[ps].z=w[ps].dp=z,ps++; w[ps].x=x,w[ps].y=z,w[ps].z=w[ps].dp=y,ps++; w[ps].x=z,w[ps].y=y,w[ps].z=w[ps].dp=x,ps++; w[ps].x=x,w[ps].y=y,w[ps].z=w[ps].dp=z,ps++; w[ps].x=z,w[ps].y=x,w[ps].z=w[ps].dp=y,ps++; w[ps].x=y,w[ps].y=z,w[ps].z=w[ps].dp=x,ps++; } } sort(w,w+ps,cmp); int ans=0; for(i=1; i<ps; i++) { for(j=i-1; j>=0; j--) if(w[i].x>w[j].x&&w[i].y>w[j].y) w[i].dp=max(w[i].dp,w[j].dp+w[i].z); if(ans<w[i].dp) ans=w[i].dp; } printf("Case %d: maximum height = %d\n",++m,ans); } return 0; }
相关文章推荐
- hdu Monkey and Banana(DP)
- rails+工作环境搭建脚本
- linux之awk用法
- 怎么在MindManager中使用自动计算功能
- JNI教程(三)
- 支付宝回应安全漏洞
- 支付宝回应安全漏洞
- VS2015密钥
- 以前的 Delphi版本
- 架构师养成记--16.disruptor并发框架中RingBuffer的使用
- MATLAB中的函数理解(二):minFunc工具包(不定期更新)
- c语言实现分析hashtable算法
- Unity脚本生命周期, Unity脚本函数执行流程与顺序
- 关于快速开发,大家可以来谈谈自己的看法
- 继承中的static
- [转载]EF或LINQ 查询时使用IN并且根据列表自定义排序方法
- 同步和异步
- [macOS] error when brew updating
- 利用iscroll4实现轮播图效果实例代码
- mybatis 别名的使用