C - Monkey and Banana HDU 1069( 动态规划+叠放长方体)
来源:互联网 发布:安川sigmawin软件 编辑:程序博客网 时间:2024/06/11 19:39
C - Monkey and Banana
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU 1069Description
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
刚开始学动态规划,还是挺难的,我参考了这位大神的思路
dp[i]:表示以p[i]这个长方体放在顶端,可以获得最大的高度。
那么状态转移是,DP[i]=max( dp[i], p[i].high + dp[j] )
#include<cstdio>#include<algorithm>#include<cmath>#include<string>#include<cstring>#include<bits/stdc++.h>using namespace std;template<class T>inline T read(T&x){ char c; while((c=getchar())<=32)if(c==EOF)return 0; bool ok=false; if(c=='-')ok=true,c=getchar(); for(x=0; c>32; c=getchar()) x=x*10+c-'0'; if(ok)x=-x; return 1;}template<class T> inline T read_(T&x,T&y){ return read(x)&&read(y);}template<class T> inline T read__(T&x,T&y,T&z){ return read(x)&&read(y)&&read(z);}template<class T> inline void write(T x){ if(x<0)putchar('-'),x=-x; if(x<10)putchar(x+'0'); else write(x/10),putchar(x%10+'0');}template<class T>inline void writeln(T x){ write(x); putchar('\n');}//-------ZCC IO template------const int maxn=400;const double inf=999999999;#define lson (rt<<1),L,M#define rson (rt<<1|1),M+1,R#define M ((L+R)>>1)#define For(i,t,n) for(int i=(t);i<(n);i++)typedef long long LL;typedef double DB;typedef pair<int,int> P;#define bug printf("---\n");#define mod 1000000007struct node{ int width,length,area,high; bool operator<(const node&a) const { return area>a.area; }}p[maxn];int dp[maxn];int main(){ int n,m,i,j,t,k; int cas=1; while(read(n)&&n) { k=0; For(i,0,n) { int w,l,h; read__(w,l,h); node tmp; tmp.width=w;tmp.length=l;tmp.high=h; tmp.area=w*l; p[k++]=tmp; tmp.width=w;tmp.length=h;tmp.high=l; tmp.area=w*h; p[k++]=tmp; tmp.width=h;tmp.length=l;tmp.high=w; tmp.area=h*l; p[k++]=tmp; } sort(p,p+k); dp[0]=p[0].high; for(i=1;i<k;i++) { dp[i]=p[i].high; for(j=0;j<i;j++)if(p[j].width>p[i].width&&p[j].length>p[i].length||p[j].width>p[i].length&&p[j].length>p[i].width) { dp[i]=max(dp[i],dp[j]+p[i].high); } }// For(i,0,k)// printf("dp[%d] = %d\n",i,dp[i]); printf("Case %d: maximum height = %d\n",cas++,*max_element(dp,dp+k)); } return 0;}
0 0
- C - Monkey and Banana HDU 1069( 动态规划+叠放长方体)
- HDU 1069 Monkey and Banana 动态规划
- HDU 1069 Monkey and Banana ( 动态规划 )
- HDU 1069 Monkey and Banana 动态规划
- HDU 1069(Monkey and Banana)动态规划
- hdu 1069 Monkey and Banana(动态规划)
- hdu-1069-Monkey and Banana(动态规划)
- Hdu 1069 Monkey and Banana 动态规划
- HDU Monkey and Banana 动态规划
- hdu 1069 Monkey and Banana(动态规划)
- HDU 1069 动态规划(DP) Monkey and Banana
- HDU ACM 1069 Monkey and Banana->动态规划
- HDU:1069 Monkey and Banana(经典动态规划DP)
- HDU 1069 Monkey and Banana (动态规划+LIS)
- HDU 1069 Monkey and Banana(动态规划DP 经典)
- hdu 1069 Monkey and Banana (动态规划)
- HDU 1069 Monkey and Banana(DP 长方体堆放问题)
- HDU 1069 Monkey and Banana(DP 长方体堆放问题)
- UGUI之用脚本动态的改变Button的背景图片
- 加载地址和运行地址
- everything start from keystone(1)
- 第一道dp 0-1背包 (饭卡)
- 电磁场强度公式与能量信号的定义原理(The Derivation of Power Signal)
- C - Monkey and Banana HDU 1069( 动态规划+叠放长方体)
- tar 命令使用,加密
- 我讨厌志向远大的人
- 对C++中虚析构函数的认识
- SQL循环语句
- Ogre骨骼动画
- 实现java String的equals方法
- centos 让普通用户支持sudo
- 波粒二象性