Sample Input
1 10 20 30 2 6 8 10 5 5 5 7 1 1 1 2 2 2 3 3 3 4 4 4 5 5 5 6 6 6 7 7 7 5 31 41 59 26 53 58 97 93 23 84 62 64 33 83 27 0
Sample Output
Case 1: maximum height = 40 Case 2: maximum height = 21 Case 3: maximum height = 28 Case 4: maximum height = 342
题目:给出一些长方体,然后让你把他堆成塔,
要求下面的塔的要比上面的塔大(长和宽),
而且每一种长方体的数量都是无限的。
此题目考察到动态规划里的最长有序子序列,
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
int x;
int y;
int z;
} a[1111];
bool cmp(node t1,node t2)
{
if(t1.x<t2.x) return true;
if(t1.x==t2.x && t1.y<t2.y) return true;
return false;
}
int main()
{
int n,i,j,ans,number,k,x,y,z,temp;
number=1;
while(scanf("%d",&n)==1 && n) {
k=0;
for(i=1;i<=n;i++) {
cin>>x>>y>>z;
a[k].x=x;a[k].y=y;a[k++].z=z;
a[k].x=x;a[k].y=z;a[k++].z=y;
a[k].x=y;a[k].y=x;a[k++].z=z;
a[k].x=y;a[k].y=z;a[k++].z=x;
a[k].x=z;a[k].y=x;a[k++].z=y;
a[k].x=z;a[k].y=y;a[k++].z=x;
}
sort(a,a+k,cmp);
ans=0;
for(i=1;i<k;i++) {
temp=0;
for(j=0;j<i;j++) {
if(a[j].x<a[i].x&&a[j].y<a[i].y) temp=max(temp,a[j].z);
}
a[i].z+=temp;
ans=max(ans,a[i].z);
}
printf("Case %d: maximum height = %d\n",number++,ans);
}
return 0;
}