思路借鉴了下别人的
据说坑爹的sort不支持二维数组,最好用结构体。
嗯……反正这道题我用不着二维数组,不过留意一下
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = int (1e9) + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
int dp[200];
class Block {
public:
int x,y,z;
void fun (int a,int b,int c) {x=a; y=b; z=c;}
} node[200];
bool cmp (Block a,Block b) {
return a.x*a.y<b.x*b.y;
}
int main() {
int num,cnt=0;
while (cin>>num&&num) {
int a,b,c,m=0;
for (int i=0; i<num; i++) {
cin>>a>>b>>c;
node[m++].fun (a, b, c);
node[m++].fun (a, c, b);
node[m++].fun (b, a, c);
node[m++].fun (b, c, a);
node[m++].fun (c, a, b);
node[m++].fun (c, b, a);
}
sort (node,node+m,cmp); int ans=0;
memset (dp,0,sizeof (dp) );
for (int i=0; i<m; i++) {
dp[i]=node[i].z;
for (int j=0; j<i; j++) {
if (node[i].x>node[j].x&&node[i].y>node[j].y) {
dp[i]=max (dp[i],dp[j]+node[i].z);
}
}
if (dp[i]>ans) {ans=dp[i];}
}
cout<<"Case "<<++cnt<<": maximum height = "<<ans<<endl;
}
return 0;
}