hdoj 1069 Monkey and Banana【dp】
来源:互联网 发布:mysql时间戳类型长度 编辑:程序博客网 时间:2024/05/05 18:22
Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10264 Accepted Submission(s): 5332
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
Source
University of Ulm Local Contest 1996
题意:可以简化为,给你n种!!(不是n个~~)长方体积木,求垒得最高的高度,条件很苛刻,上面的长方体的长和宽只能小于它下面的长方体的长和宽!!剩下的就是把所有情况存储下,排序,最后就是dp;
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int h[300];struct node{int x,y,z;}p[300];int cmp(node a, node b){if(a.x!=b.x)returna.x < b.x;if(a.y!=b.y)returna.y < b.y;return a.z < b.z;}int main(){int n,ca=1;while(~scanf("%d", &n),n){int i,j,a,b,c, t = 0;for(i = 0; i < n; i++){scanf("%d%d%d", &a, &b, &c);p[i*3].x = a>b?a:b;p[i*3].y = a>b?b:a;p[i*3].z = c;p[i*3+1].x = b>c?b:c;p[i*3+1].y = b>c?c:b;p[i*3+1].z = a;p[i*3+2].x = a>c?a:c;p[i*3+2].y = a>c?c:a;p[i*3+2].z = b;}sort(p, p+3*n, cmp);int maxx;int ans = h[0] = p[0].z;for(i = 1; i < n*3; i++){maxx = 0;for(j = 0; j < i; j++){if(p[i].x > p[j].x && p[i].y > p[j].y && h[j] > maxx)maxx = h[j];h[i] = maxx+p[i].z;if(h[i] > ans)ans = h[i];}}printf("Case %d: maximum height = %d\n",ca++,ans);}return 0;}
0 0
- HDOJ 1069 Monkey and Banana 【DP】
- hdoj 1069 Monkey and Banana 【DP】
- hdoj 1069 Monkey and Banana【dp】
- hdoj--1069 Monkey and Banana(dp)
- HDOJ 1069 Monkey and Banana DP
- HDOJ 1069 Monkey and Banana(DP)
- HDOJ 1069 Monkey and Banana
- HDOJ 1069 Banana and Monkey
- HDOJ 1069 Monkey and Banana
- HDOJ-1069 Monkey and Banana
- hdoj 1069 Monkey and Banana
- HDOJ 1069 Monkey and Banana
- HDOJ-----1069Monkey and Banana
- Monkey and Banana Hdoj
- Monkey and Banana dp
- hdu/hdoj 1069 Monkey and Banana
- HDOJ 1069 Monkey and Banana(LIS)
- hdoj-1069-Monkey and Banana【动态规划】
- 我的书单
- java中如何创建自己的类加载器详解
- Android Studio 自定义属性
- iOS推送基本原理
- selinux 查看 关闭
- hdoj 1069 Monkey and Banana【dp】
- 通过spark-redshift工具包读取redshift上的表
- 在vector的循环中调用erase
- libevent代码阅读(2)——尾队列的学习
- 新生记
- eclipse中文语言包 离线安装
- 可替代CSS3 transition和transform的jQuery插件
- phpmyadmin 配置文件权限错误,无法写入!
- 线性表的动态分配顺序存储结构