例题9-2(uva-437)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 256;
int n, cnt,dp[maxn];
struct Node
{
	int l, w, h;
	bool operator<(const Node& input) {
		if (l != input.l) return l < input.l;
		if (w != input.w) return w < input.w;
		return h < input.h;
	}
}nodes[maxn];

void Input(int a,int b,int c) {
	nodes[cnt].l = a;
	nodes[cnt].w = b;
	nodes[cnt++].h = c;
}

int main()
{
	int a, b, c,kCase = 0;
	while (cin >> n && n) {
		cnt = 0;
		for (int i = 0; i < n; i++) {
			cin >> a >> b >> c;
			Input(a, b, c);
			Input(a, c, b);
			Input(b, a, c);
			Input(b, c, a);
			Input(c, a, b);
			Input(c, b, a);
		}
		int ans = 0;
		sort(nodes, nodes + cnt);

		for (int i = 0; i < cnt; i++) {
			dp[i] = nodes[i].h;
			for (int j = 0; j < i; j++) {
				if (nodes[j].l < nodes[i].l && nodes[j].w < nodes[i].w) {
					dp[i] = max(dp[i], dp[j] + nodes[i].h);
				}
			}
			ans = max(dp[i], ans);
		}
		cout << "Case " << ++kCase << ": maximum height = " << ans << endl;
	}
	return 0;
}