</pre><pre name="code" class="html"><pre name="code" class="cpp">#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define INF 0x3f3f3f3f
struct rangle
{
int x,y;
int power;
}s[5005];
int cmp(const void *a,const void *b) //按照x的值从小到大将结构体排序
{
return (*(struct rangle *)a).x>(*(struct rangle *)b).x ? 1 : -1;
}
int main()
{
//freopen("input.txt","r",stdin);
int a,b,c,n,sum;
int i,j,k,dp[5005],max;
int ca=1;
while(scanf("%d",&n)==1)
{
if(n==0)
break;
for(i=0,j=0;i<n;i++)
{
scanf("%d%d%d",&a,&b,&c);
s[j].x=a; s[j].y=b; s[j++].power=c;
s[j].x=b; s[j].y=a; s[j++].power=c;
s[j].x=b; s[j].y=c; s[j++].power=a;
s[j].x=c; s[j].y=b; s[j++].power=a;
s[j].x=a; s[j].y=c; s[j++].power=b;
s[j].x=c; s[j].y=a; s[j++].power=b;
}
sum=j;
qsort(s,sum,sizeof(struct rangle),cmp);
memset(dp,0,sizeof(dp));
dp[0]=s[0].power;
for(i=1;i<sum;i++)
{
max=s[i].power;
for(j=0;j<i;j++)
{
if(s[i].y>s[j].y&&s[i].x>s[j].x)
{
if(dp[j]+s[i].power>max)
max=dp[j]+s[i].power;
}
}
dp[i]=max;
}
for(i=0,max=0;i<sum;i++)
{
if(dp[i]>max)
max=dp[i];
}
printf("Case %d: maximum height = %d\n",ca++,max);
}
return 0;
}
hdu1069 Monkey and Banana
最新推荐文章于 2018-07-20 19:13:20 发布