Monkey and Banana（线性dp）

Monkey and Banana

 

 AC_Code:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 222;

int n,ans[maxn];
struct node{
    int len,wide,high;
}block[maxn];

bool cmp(node a, node b){//长从小到大排,长相同时,款从小到大排
    if(a.len==b.len){
        return a.wide<b.wide;
    }
    else return a.len<b.len;
}

int main()
{
    int t=0;
    while( scanf("%d",&n)&&n ){
        int a,b,c,k=0;

        while( n-- ){
            scanf("%d %d %d",&a,&b,&c);//每种都最多有6中摆放方式
            block[k].len=a; block[k].wide=b; block[k++].high=c;
            block[k].len=a; block[k].wide=c; block[k++].high=b;
            block[k].len=b; block[k].wide=a; block[k++].high=c;
            block[k].len=b; block[k].wide=c; block[k++].high=a;
            block[k].len=c; block[k].wide=a; block[k++].high=b;
            block[k].len=c; block[k].wide=b; block[k++].high=a;
        }

        sort(block,block+k,cmp);
        for(int i=0;i<k;i++){
            ans[i]=block[i].high;
        }

        for(int i=0;i<k;i++){//类似于LIS
            for(int j=0;j<i;j++){
                if( block[i].len>block[j].len && block[i].wide>block[j].wide ){
                    ans[i] = max(ans[i], ans[j]+block[i].high);
                }
            }
        }

        sort(ans,ans+k);
        printf("Case %d: maximum height = %d
",++t, ans[k-1]);

    }
    return 0;
}