zoukankan      html  css  js  c++  java
  • [HDU 1069] Monkey and Banana

    Monkey and Banana

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 7854    Accepted Submission(s): 4051

    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.
     
    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
     
    Source
    University of Ulm Local Contest 1996
     
    LIS变型、上代码、= =
    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    using namespace std;
    #define max(a,b) ((a)>(b)?(a):(b))
    #define N 100100
    struct Rect
    {
        int x,y,z;
        bool operator <(const Rect &t)const
        {
            if(x!=t.x) return x<t.x;
            return y<t.y;
        }
    }s[N];
    int main()
    {
        int dp[N]; //dp[i]表示以第i个长方体结尾的最大高度
        int n,i,j,m,iCase=0;
        while(scanf("%d",&m),m)
        {
            n=0;
            memset(dp,0,sizeof(dp));
            while(m--)
            {
                int x,y,z;
                scanf("%d%d%d",&x,&y,&z);
                s[++n].x=x;s[n].y=y;s[n].z=z;
                if(s[n].x<s[n].y) swap(s[n].x,s[n].y);
                s[++n].x=x;s[n].y=z;s[n].z=y;
                if(s[n].x<s[n].y) swap(s[n].x,s[n].y);
                s[++n].x=z;s[n].y=y;s[n].z=x;
                if(s[n].x<s[n].y) swap(s[n].x,s[n].y);
            }
            sort(s+1,s+n+1);
            for(i=1;i<=n;i++)
            {
                dp[i]=s[i].z;
                for(j=1;j<i;j++)
                {
                    if(s[i].x>s[j].x && s[i].y>s[j].y) dp[i]=max(dp[i],dp[j]+s[i].z);
                }
            }
            int ans=-1;
            for(i=1;i<=n;i++)
            {
                ans=max(ans,dp[i]);
            }
            printf("Case %d: maximum height = %d
    ",++iCase,ans);
        }
        return 0;
    }
    趁着还有梦想、将AC进行到底~~~by 452181625
  • 相关阅读:
    转载文章----.NET 框架浅析
    转载文章----IL反编译利器——Ildasm.exe和Reflector.exe:
    转载文章----初识Ildasm.exe——IL反编译的实用工具
    北航物理实验
    计算机组成原理往年试题以及答案(tzf!!!)
    Java 往年试卷参考答案!!!
    算法导论期末考试英文练习题带答案!!!
    算法导论( FFT & 自动机 & 最优二叉搜索树 !!!)
    Java部分总结图片版2(已加上原图链接!!!)
    Java部分总结图片版(已经加上原图链接下载!!!)
  • 原文地址:https://www.cnblogs.com/hate13/p/4060048.html
Copyright © 2011-2022 走看看