HDU1069
来源:互联网 发布:python 粒子群算法库 编辑:程序博客网 时间:2024/06/13 03:45
Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10587 Accepted Submission(s): 5497
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
大概就是一个LIS问题,在刘汝佳的书上叫做DAG问题,不过本质都一样,这里要注意的是木块的摆放方式可以有多种,用一个com函数去人为设置sort排序的条件
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct _data{int x, y, z, area;};_data data[200];bool com(_data d1, _data d2){return d1.area < d2.area;}int n;int dp[200];int main(){int count = 1;while (scanf("%d", &n) != EOF){int index = 0;for (int i = 0; i < n; i++){int x, y, z;scanf("%d%d%d", &x, &y, &z);data[index].x = x; data[index].y = y; data[index].z = z; data[index++].area = x*y;data[index].x = y; data[index].y = x; data[index].z = z; data[index++].area = x*y;data[index].x = y; data[index].y = z; data[index].z = x; data[index++].area = z*y;data[index].x = z; data[index].y = y; data[index].z = x; data[index++].area = z*y;data[index].x = x; data[index].y = z; data[index].z = y; data[index++].area = x*z;data[index].x = z; data[index].y = x; data[index].z = y; data[index++].area = x*z;}sort(data, data + index, com);memset(dp, 0, sizeof(dp));dp[0] = data[0].z;for (int i = 1; i < index; i++){int temp = 0;for (int j = 0; j < i; j++){if (data[i].x>data[j].x&&data[i].y>data[j].y){temp = dp[j];dp[i] = temp + data[i].z;}}int ans = dp[0];for (int i = 1; i < index; i++){ans = max(ans, dp[i]);}}printf("Case %d: maximum height = %d\n", count++,ans);}return 0;}
0 0
- hdu1069
- hdu1069
- hdu1069
- hdu1069
- HDU1069
- hdu1069
- HDU1069
- hdu1069
- hdu1069
- HDU1069
- HDU1069
- hdu1069(dp)
- HDU1069(DAG)
- HDU1069--Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069 Monkey and Banana
- hdu1069(记忆化搜索)
- HDU1069(还是dp基础)
- 敌兵布阵
- performSelector mey leak
- Android的GridView:点击空白地方事件扩展的监听
- linux上使用netstat查看当前服务和监听端口
- 10. 子查询
- HDU1069
- Android屏幕适配方案:产品级的解决方案
- 《Java编程思想》第五章 初始化与清理
- linux 添加自定义指令 tomcat
- 11. 集合运算
- Linux环境软件安装流程
- IOS内存管理
- Matplotib tutorial(2)
- 3339: Rmq Problem/3585: mex 莫队算法