[HDU 1069 DP]Monkey and Banana

方法1：
dp[i][j]记为在第i层使用第j块block的最大高度。三重for循环：

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N = 95;
int n;
typedef long long ll;
struct block{
	int x,y,h;
	block(int _x,int _y,int _h):x(_x),y(_y),h(_h){
	}
	
};
vector<block> blocks;
ll dp[2 * N][N];
ll ans;
int cas = 0;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin>>n){
		if(n == 0)break;
		memset(dp,0,sizeof(dp));
		ans = 0;
		blocks.clear();
		for(int i = 0;i < n;i++){
			int x,y,z;
			cin>>x>>y>>z;
			blocks.pb(block(x,y,z));
			blocks.pb(block(x,z,y));
			blocks.pb(block(y,z,x));
		}
		for(int i = 0;i < blocks.size();i++){
			dp[0][i] = blocks[i].h;
			ans = max(ans,dp[0][i]);
		}

		for(int i = 1;i < 2 * n;i++){
			for(int j = 0;j < blocks.size();j++){
				for(int k = 0;k < blocks.size();k++){
					if((blocks[j].x > blocks[k].x && blocks[j].y > blocks[k].y) || (blocks[j].y > blocks[k].x && blocks[j].x > blocks[k].y)){
						dp[i][k] = max(dp[i - 1][j] + blocks[k].h,dp[i][k]);
						ans = max(ans,dp[i][k]);
					}
				}
			}
		}
		printf("Case %d: maximum height = %lld\n",++cas,ans);
	}
	return 0;
}

方案二：
方块是有一定顺序的，一个方块只能在一些特定的方块之后，因此可以先排序，dp[i]表示以i方块为尾部的最大高度，这个方案只需要for两重循环。

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N = 200;
int n;
typedef long long ll;
struct block{
	int x,y,h;
	block(int _x,int _y,int _h):x(_x),y(_y),h(_h){
	}
	bool operator<(const block & b){
		if(x != b.x)return x > b.x;
		return y > b.y;
	} 
	
};
vector<block> blocks;
ll dp[N];
ll ans;
int cas = 0;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin>>n){
		if(n == 0)break;
		memset(dp,0,sizeof(dp));
		ans = 0;
		blocks.clear();
		for(int i = 0;i < n;i++){
			int x,y,z;
			cin>>x>>y>>z;
			blocks.pb(block(x,y,z));
			blocks.pb(block(y,x,z));
			blocks.pb(block(x,z,y));
			blocks.pb(block(z,x,y));
			blocks.pb(block(y,z,x));
			blocks.pb(block(z,y,x));
		}
		sort(blocks.begin(),blocks.end());
		for(int i = 0;i < blocks.size();i++){
			dp[i] = blocks[i].h;
			for(int j = 0;j < i;j++){
				if(blocks[j].x > blocks[i].x && blocks[j].y > blocks[i].y){
					dp[i] = max(dp[i], dp[j] + blocks[i].h);
					ans = max(dp[i],ans);
				}
			}
		}
		printf("Case %d: maximum height = %lld\n",++cas,ans);
	}
	return 0;
}