dp基础4 - C - Monkey and Banana HDU - 1069

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<algorithm>
#include<iostream>
#include<set>
using namespace std;
const int mmax = 600100;
const int inf = 0x3f3f3f3f;
int dp[mmax],data[mmax],da[mmax];
int n,m,k;
struct node
{
int x,y,z;
}b[90000];
int cmp(node a,node b)
{
if(a.x==b.x) return a.y>b.y;
else return a.x>b.x;
}
//按x,y优先降序
int main()
{
int n;
int cases = 0;
while(cin>>n)
{
if(n==0)break;
int k = 0;
int x,y,z;
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&x,&y,&z);
b[k].x = x,b[k].y = y,b[k++].z = z;
b[k].x = x,b[k].y = z,b[k++].z = y;
b[k].x = y,b[k].y = x,b[k++].z = z;
b[k].x = y,b[k].y = z,b[k++].z = x;
b[k].x = z,b[k].y = x,b[k++].z = y;
b[k].x = z,b[k].y = y,b[k++].z = x;
// b[k].x = x,b[k].y = y,b[k++].z = z;
}
int dp[99999];
sort(b,b+k,cmp);
for(int i=0;i<k;i++)
dp[i] = b[i].z;//dp数组初始化
for(int i=0;i<k;i++)
{
for(int j=0;j<i;j++)//关键的双重循环
{
if(b[i].x<b[j].x&&b[i].y<b[j].y)//满足条件则更新
{
dp[i] = max(dp[i],dp[j]+b[i].z);
}
}
}
int mm = *max_element(dp,dp+k);
printf("Case %d: maximum height = %d\n",++cases,mm);
}
return 0;
}