【HDU
来源:互联网 发布:什么是数据api接口 编辑:程序博客网 时间:2024/06/06 03:15
点击打开链接
Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16303 Accepted Submission(s): 8674
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.
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.
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
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
//代码如下:
#include<cstdio>#include<cstring>#include<map>#include<vector>#include<algorithm>using namespace std;#define INF 0x3f3f3f3fstruct Brick{int x,y,z;}brick[200];int ant;void UpDate(int x,int y,int z){brick[ant].x = x;brick[ant].y = y;brick[ant++].z = z;brick[ant].x = x;brick[ant].y = z;brick[ant++].z = y;brick[ant].x = y;brick[ant].y = x;brick[ant++].z = z;brick[ant].x = y;brick[ant].y = z;brick[ant++].z = x;brick[ant].x = z;brick[ant].y = x;brick[ant++].z = y;brick[ant].x = z;brick[ant].y = y;brick[ant++].z = x;}bool cmp(Brick a,Brick b){if (a.x == b.x)return a.y > b.y;return a.x > b.x;}//dp[i]: i表示以第i块砖头结尾能到达的最高高度 //dp[i] = max(brick[i].z , dp[j:(1~i-1)] + brick[i].z)//if : brick[i].x < brick[j].x && brick[i].y < brick[j].yint main(){int n;int Case = 1;while (~scanf ("%d",&n) && n){ant = 1;for (int i = 1 ; i <= n ; i++){int x,y,z;scanf ("%d%d%d",&x,&y,&z);UpDate(x,y,z);}ant--;sort(brick+1,brick+1+ant,cmp);int dp[200];int ans = 0;for (int i = 1 ; i <= ant ; i++){dp[i] = brick[i].z;for (int j = 1 ; j < i ; j++){if (brick[i].x < brick[j].x && brick[i].y < brick[j].y)dp[i] = max(dp[i], dp[j] + brick[i].z);ans = max(ans , dp[i]);}}printf ("Case %d: maximum height = %d\n",Case++,ans);}return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- [Android6.0][RK3399] 实现耳机和喇叭自动切换功能
- SOCKET用户接口与系统调用关系
- Eclipse安装
- UVA
- PAT 1034. Head of a Gang (30) DFS,删边
- 【HDU
- linux的Anaconda环境下安装TensorFlow
- HDU 6166 2017多校 Team09 1006:Dijkstra顶点子集最短路径
- 深入了解HDMI接口
- JDBC概述和初体验
- 使用Rancher创建负载均衡的容器应用
- java提高篇(七)-----关键字static
- 【tensorflow 学习】seq2seq模型代码解读
- SpringMVC框架向页面传值的4种方法