E - Monkey and Banana

最新推荐文章于 2019-05-17 16:49:03 发布

LMengi000

最新推荐文章于 2019-05-17 16:49:03 发布

阅读量201

点赞数

分类专栏： ACM-动态规划

本文链接：https://blog.csdn.net/LMengi000/article/details/79858616

版权

ACM-动态规划专栏收录该内容

7 篇文章 1 订阅

订阅专栏

E - Monkey and Banana

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

Sample Output

Case 1: maximum height = 40
Case 2: maximum height = 21
Case 3: maximum height = 28
Case 4: maximum height = 342

方法一：动态规划背包问题（像01背包问题）

参考网址：http://www.it610.com/article/5279334.htm

https://blog.csdn.net/lishuhuakai/article/details/8060529

题意：多组数据输入，第一行输入n，接着n行给出n组坐标，x，y，z，分别是长方体的长宽高，这三个数字的顺序可以颠倒，随便一个数都可以作为长方体的长或宽或高，而且这种型号的长方体有无数个。(以为无数多个就可以无数往上摞？）
把长方体摞一块，要求上面长方体的长和宽都要小于下面长方体的长和宽，输出能够摞出的最大高度。

思路：接收到x，y，z这三个数字后，组合出三种长方形，把新的长方体的数据存起来，然后就是简单的动规；

状态转移方程：dp[i]=max(dp[i],dp[j]+num[i].h)
如果看不懂的话，可以接着看下面的代码

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
struct shu{
int x;
int y;
int h;
}num[1005];
int dp[1005];
int a[1005];
bool compare(struct shu a,struct shu b){
  if(a.x>b.x) return true;
  if(a.x==b.x && a.y>b.y) return true;
  return false;
}
int main(){
int n,i,j,cnt=1,length;
while(scanf("%d",&n)&&n){
    length=0;
    memset(num,0,sizeof(num));
    for(i=0;i<n;i++){
        scanf("%d%d%d",&a[0],&a[1],&a[2]);
        sort(a,a+3);//顺序保证面积是从大到小的，保证下面的长宽最大，这样往上放才能放到最多
        num[length].x=a[2];
        num[length].y=a[1];
        num[length].h=a[0];
        length++;
        num[length].x=a[2];
        num[length].y=a[0];
        num[length].h=a[1];
        length++;
        num[length].x=a[1];
        num[length].y=a[0];
        num[length].h=a[2];
        length++;
    }
    sort(num,num+length,compare);
    for(i=0;i<length;i++)
        dp[i]=num[i].h;//dp存放的所有可能的高度
    for(i=length-2;i>=0;i--){
        for(j=i+1;j<length;j++){
            if(num[i].x>num[j].x&&num[i].y>num[j].y){//下面的长要比上面的长更长，下面的宽要比上面的宽更宽
                if(dp[i]<dp[j]+num[i].h)//dp[i]=max(dp[i],dp[j]+num[i].h) 
                    //将当前高度与（上一个高度和当前高度之和）比较，确定放还是不放，如果当前高度比放上还要高，就不要放了
                    dp[i]=dp[j]+num[i].h;//高度的更替
            }
        }
    }
    int maxlen=dp[0];//找长最大高度
    for(i=0;i<length;i++){
        if(dp[i]>maxlen)
            maxlen=dp[i];
    }
    printf("Case %d: maximum height = %d\n",cnt++,maxlen);
}

}

方法二：最长有序子序列

参考网址：http://www.lxway.com/501964422.htm


/*
HDU1069Monkey and Banana
题目：给出一些长方体，然后让你把他堆成塔，
要求下面的塔的要比上面的塔大（长和宽），
而且每一种长方体的数量都是无限的。

此题目考察到动态规划里的最长有序子序列，

*/
#include<stdio.h>
#include<algorithm>
const int MAXN=200;
using namespace std;
struct Block
{
    int x,y,high;
    int dp;//该箱子在最下面时的最大高度 
}b[MAXN];

bool cmp(Block a,Block b)//用sort函数排序，先按x后按y升序
{
    if(a.x<b.x) return 1;
    else if(a.x==b.x&&a.y<b.y)  return 1;
    else return 0;
}        
int main()
{
    int n,i,x,y,z,j,k;
    int iCase=0;
    while(scanf("%d",&n),n)
    {
        iCase++;
        k=0;
        while(n--)
        {
            scanf("%d%d%d",&x,&y,&z);
            //把给出的block放置的所有可能放进block[]中，这样就可以解决有无限块的问题
            if(x==y)
            {
                if(y==z)//三个相等，放一个就够了
                {
                    b[k].x=x;b[k].y=y;b[k].high=z;b[k].dp=b[k].high;k++;
                }
                else  //x==y!=z时三种放法
                {
                    b[k].x=x;b[k].y=y;b[k].high=z;b[k].dp=b[k].high;k++;
                    b[k].x=z;b[k].y=y;b[k].high=x;b[k].dp=b[k].high;k++;
                    b[k].x=y;b[k].y=z;b[k].high=x;b[k].dp=b[k].high;k++;
                }                         
            }
            else
            {
                if(y==z)//三种放法
                {
                    b[k].x=x;b[k].y=y;b[k].high=z;b[k].dp=b[k].high;k++;
                    b[k].x=y;b[k].y=x;b[k].high=z;b[k].dp=b[k].high;k++;
                    b[k].x=y;b[k].y=z;b[k].high=x;b[k].dp=b[k].high;k++;
                } 
                else if(x==z)
                {
                    b[k].x=x;b[k].y=y;b[k].high=z;b[k].dp=b[k].high;k++;
                    b[k].x=y;b[k].y=x;b[k].high=z;b[k].dp=b[k].high;k++;
                    b[k].x=x;b[k].y=z;b[k].high=y;b[k].dp=b[k].high;k++;
                }  
                else//三个不等6种放法 
                {
                    b[k].x=x;b[k].y=y;b[k].high=z;b[k].dp=b[k].high;k++;
                    b[k].x=y;b[k].y=x;b[k].high=z;b[k].dp=b[k].high;k++;
                    b[k].x=x;b[k].y=z;b[k].high=y;b[k].dp=b[k].high;k++;
                    b[k].x=z;b[k].y=x;b[k].high=y;b[k].dp=b[k].high;k++;
                    b[k].x=y;b[k].y=z;b[k].high=x;b[k].dp=b[k].high;k++;
                    b[k].x=z;b[k].y=y;b[k].high=x;b[k].dp=b[k].high;k++;
                }          
            }        
        } 
        sort(b,b+k,cmp);
        int maxh=0;
        for(i=1;i<k;i++)
        {
            for(j=0;j<i;j++)
               if(b[i].x>b[j].x&&b[i].y>b[j].y)
                  b[i].dp=max(b[j].dp+b[i].high,b[i].dp);
            if(b[i].dp>maxh)maxh=b[i].dp;
        } 
        printf("Case %d: maximum height = %d\n",iCase,maxh);      
    }  
    return 0;  
}

以下代码有误：：：


/*
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
using namespace std;
struct shu{
 int x;
 int y;
 int h;
 int dp;
}num[205];
bool compare(struct shu a,struct shu b){
 if(a.x<b.y) return true;
 if(a.x==b.x && a.y<b.y) return true;
 return false;
}
int main(){
int n,i,j,x,y,z;
int cnt=1;
int k;
while(scanf("%d",&n)&&n){
    k=0;
   for(i=0;i<n;i++){
    scanf("%d%d%d",&x,&y,&z);
    if(x==y){
        if(y==z){
           num[k].x=x;
           num[k].y=y;
           num[k].h=z;
           num[k].dp=num[k].h;
           k++;
        }else{
         num[k].x=x;num[k].y=y;num[k].h=z;num[k].dp=num[k].h;k++;
         num[k].x=z;num[k].y=y;num[k].h=x;num[k].dp=num[k].h;k++;
         num[k].x=y;num[k].y=z;num[k].h=x;num[k].dp=num[k].h;
         k++;
        }
    }else{
        if(y==z){
        num[k].x=x;num[k].y=y;num[k].h=z;num[k].dp=num[k].h;k++;
        num[k].x=y;num[k].y=x;num[k].h=z;num[k].dp=num[k].h;k++;
        num[k].x=z;num[k].y=y;num[k].h=x;num[k].dp=num[k].h;
        k++;
        }
        else if(x==z){
        num[k].x=x;num[k].y=y;num[k].h=z;num[k].dp=num[k].h;k++;
        num[k].x=y;num[k].y=x;num[k].h=z;num[k].dp=num[k].h;k++;
        num[k].x=x;num[k].y=z;num[k].h=y;num[k].dp=num[k].h;
        k++;
        }else{
        num[k].x=x;num[k].y=y;num[k].h=z;num[k].dp=num[k].h;k++;
        num[k].x=y;num[k].y=x;num[k].h=z;num[k].dp=num[k].h;k++;
        num[k].x=y;num[k].y=z;num[k].h=x;num[k].dp=num[k].h;k++;
        num[k].x=x;num[k].y=z;num[k].h=y;num[k].dp=num[k].h;k++;
        num[k].x=z;num[k].y=x;num[k].h=y;num[k].dp=num[k].h;k++;
        num[k].x=z;num[k].y=y;num[k].h=x;num[k].dp=num[k].h;k++;
        }
    }
   }
   sort(num,num+k,compare);
   int maxlen=0;
   for(i=1;i<k;i++){
    for(j=0;j<i;j++){
        if(num[i].x>num[j].x && num[i].y>num[j].y){
            num[i].dp=max(num[j].dp+num[i].h,num[i].dp);
        }
    }
    if(num[i].dp>maxlen)
        maxlen=num[i].dp;

   }
   //for(i=0;i<k;i++){
   // if(num[i].dp>maxlen)
  //      maxlen=num[i].dp;
  // }
   printf("Case %d: maximum height = %d\n",cnt++,maxlen);
 }
 return 0;
}
*/