hdu 1069 dp
来源:互联网 发布:炒股模拟软件下载 编辑:程序博客网 时间:2024/06/06 00:13
http://acm.hdu.edu.cn/showproblem.php?pid=1069
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
以长方体的六个不同的面做底,从而将一个长方体变成了六个不同的。对这6*n个长方体做处理即可。
状态转移方程:
dp[i]=max(dp[i],dp[j]+a[i].c);
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>using namespace std;struct note{ int a,c,b,s;};note a[10005];int cmp(note x,note y){ return x.s<y.s;}int dp[10005];int main(){ int n,x,z,y; int tt=1; while(~scanf("%d",&n)) { if(n==0) break; memset(dp,0,sizeof(dp)); int k=1; for(int i=0;i<n;i++) { scanf("%d%d%d",&x,&y,&z); a[k].a=x;a[k].b=y,a[k].c=z;a[k++].s=x*y; a[k].a=x;a[k].b=z,a[k].c=y;a[k++].s=x*z; a[k].a=y;a[k].b=z,a[k].c=x;a[k++].s=z*y; a[k].a=y;a[k].b=x,a[k].c=z;a[k++].s=x*y; a[k].a=z;a[k].b=x,a[k].c=y;a[k++].s=x*z; a[k].a=z;a[k].b=y,a[k].c=x;a[k++].s=z*y; } sort(a+1,a+k,cmp); /*for(int i=1;i<k;i++) printf("(%d,%d,%d,%d)\n",a[i].a,a[i].b,a[i].c,a[i].s); dp[1]=a[1].c; printf("**%d**\n",dp[1]);*/ for(int i=1;i<k;i++) { dp[i]+=a[i].c; for(int j=1;j<i;j++) { if(a[i].a>a[j].a&&a[i].b>a[j].b) dp[i]=max(dp[i],dp[j]+a[i].c); } } int maxx=-100005; for(int i=1;i<=k;i++) { maxx=max(maxx,dp[i]); // printf("[%d] ",dp[i]); } printf("Case %d: maximum height = %d\n",tt++,maxx); } return 0;}
0 0
- HDU 1069 dp
- HDU 1069 DP
- hdu 1069 DP
- HDU 1069 DP
- hdu 1069 dp
- HDU 1069 dp
- hdu 1069 dp
- HDU 1069 (DP)
- HDU 1069 DP 经典
- hdu 1069 (dp)
- DP HDU-1069
- #HDU 1069 简单dp
- HDU 1069 dp??
- hdu 1069(dp)
- HDU 1069 DP
- hdu 1069 dp
- [DP] HDU 1069
- HDU DP
- java实现数字渐隐效果
- easyui datagrid 加载php的数组
- hud 1312 Red and Black
- User Profile Service Stuck on Starting --用户配置文件停在“启动中”
- easyui datagrid 的数据加载
- hdu 1069 dp
- js获取php中的数组
- Git 命令与使用
- js读取json数据
- ubuntu 安装 svn 服务器
- 三五八十记牌器
- Select For Update行级锁定
- ActionBar中的下拉菜单操作
- Android存储对象到本地(SharedPreferences方式和file方式)