C - Monkey and Banana——POJ
来源:互联网 发布:微信三级分销系统源码 编辑:程序博客网 时间:2024/06/05 06:23
C - Monkey and Banana
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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
利用DP,一维数组,具体解释看程序:
#include<stdio.h>#include<string.h>typedef struct block{int l;int w;int h;int area;}BLOCK;BLOCK que[1000];int dp[1000];void sort(int n);int main(){int n=1;int s=0;int l,w,h;BLOCK temp;while(scanf("%d",&n)&&n){ memset(dp,0,sizeof(dp));memset(que,0,sizeof(que));s++;int len=0;for(int i=1;i<=n;i++){scanf("%d %d %d",&l,&w,&h);//三种状态 temp.l=l;temp.w=w;temp.h=h;temp.area=w*l;que[len++]=temp;temp.l=l;temp.w=h;temp.h=w;temp.area=h*l;que[len++]=temp;temp.l=h;temp.w=w;temp.h=l;temp.area=h*w;que[len++]=temp;}sort(len);//排序 for(int i=0;i<len;i++)//初始化 {dp[i]=que[i].h; }//动规求解,dp[i]= max{dp[j]}+que[i].h (0<j<i)//表示以第i块为底 for(int i=1;i<len;i++){for(int j=0;j<i;j++){if(que[j].l<que[i].l&&que[j].w<que[i].w||que[j].w<que[i].l&&que[j].l<que[i].w){if(dp[j]+que[i].h>dp[i])dp[i]=dp[j]+que[i].h;}}}int max=0;//找最大值 for(int i=0;i<len;i++){if(max<dp[i])max=dp[i];}printf("Case %d: maximum height = %d\n",s,max); }}void sort(int n){BLOCK temp;int i,j;for(i=0;i<n;i++){for(j=i;j<n;j++){if(que[i].area>que[j].area){temp=que[i];que[i]=que[j];que[j]=temp;}}}}
0 0
- C - Monkey and Banana——POJ
- HDU1069——Monkey and Banana
- hdu1069——Monkey and Banana
- hdu 1069 —— Monkey and Banana
- HDU 1069 —— Monkey and Banana
- HDU1069 Monkey and Banana ——dp
- HDU 1069 Monkey and Banana (C)
- 动态规划入门——Monkey and Banana
- ACM-经典DP之Monkey and Banana——hdu1069
- 杭电ACM1069——Monkey and Banana~~动态规划
- hdu(1069)——Monkey and Banana(LIS变形)
- HDU1069——Monkey and Banana(动态规划)
- HDU1069——Monkey and Banana(动态规划)
- HDU 1069 Monkey and Banana——DP
- ZOJ 1093—Monkey and Banana 解题报告
- Monkey and Banana Problem
- HDUOJ1069 Monkey and Banana
- JOJ1126 Monkey and Banana
- 一个jar包冲突引起的StackOverflowError
- mysql 最基础操作
- ubuntu 安装jdk及配置环境变量
- 配置linux x86 arm QT4.7.3开发环境
- Kafka设计解析(四)- Kafka Consumer设计解析
- C - Monkey and Banana——POJ
- Opencv函数研究
- Spring声明式事务配置管理方法(Spring中的四种声明式事务的配置)
- 菜鸟成长记-清理缓存
- 交互设计的根本是用户体验
- 不能设置类range的columnwidth属性 解决方法
- SQLite学习手册
- 代码阅读——十个C开源项目
- HDU1045 贪心+搜索