問題：Do you remember our children time? When we are children, we are interesting in almost everything around ourselves. A little thing or a simple game will brings us lots of happy time! LLL is a nostalgic boy, now he grows up. In the dead of night, he often misses something, including a simple game which brings him much happy when he was child. Here are the game rules: There lies many blocks on the ground, little LLL wants build "Skyscraper" using these blocks. There are three kinds of blocks signed by an integer d. We describe each block's shape is Cuboid using four integers ai, bi, ci, di. ai, bi are two edges of the block one of them is length the other is width. ci is
thickness of the block. We know that the ci must be vertical with earth ground. di describe the kind of the block. When di = 0 the block's length and width must be more or equal to the block's length and width which lies under the block. When di = 1 the block's length and width must be more or equal to the block's length which lies under the block and width and the block's area must be more than the block's area which lies under the block. When di = 2 the block length and width must be more than the block's length and width which lies under the block. Here are some blocks. Can you know what's the highest "Skyscraper" can be build using these blocks?
?

Input
The input has many test cases.
For each test case the first line is a integer n ( 0< n <= 1000) , the number of blocks.
From the second to the n+1'th lines , each line describing the i‐1'th block's a,b,c,d (1 =< ai,bi,ci <= 10^8 , d = 0 or 1 or 2).
The input end with n = 0.
?

Output
Output a line contains a integer describing the highest "Skyscraper"'s height using the n blocks.
?

Sample Input
3
10 10 12 0
10 10 12 1
10 10 11 2
2
10 10 11 1
10 10 11 1
0

?
Sample Output
24
11

回答：題意大概是給你些積木，分三類，0：只能放在小于等于它的長(zhǎng)和寬的積木上，1：只能放在長(zhǎng)和寬小于等于它且面積小于他的木塊上，2：只能放在長(zhǎng)和寬偶小于它的木塊上。求積木的最高高度。

#include<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
struct block
{
?? ?int x,y,z,d;
}b[1005];
long long dp[1005];
int n;
bool cmp(block a,block b)
{
?? ?if(a.x!=b.x)return a.x<b.x;
?? ?if(a.y!=b.y)return a.y<b.y;
?? ?return a.d>b.d;
}
void DP()
{
?? ?long long ans=b[0].z;
?? ?for(int i=0;i<n;i++)
?? ?{
?? ??? ?dp[i]=b[i].z;
?? ??? ?ans=max(ans,dp[i]);
?? ?}
?? ?for(int i=1;i<n;i++)
?? ?{
?? ??? ?if(b[i].d==0)
?? ??? ?{
?? ??? ??? ?for(int j=0;j<i;j++)
?? ??? ??? ?{
?? ??? ??? ??? ?if(b[j].x<=b[i].x&&b[j].y<=b[i].y)
?? ??? ??? ??? ??? ?dp[i]=max(dp[i],dp[j]+b[i].z);
?? ??? ??? ?}
?? ??? ?}
?? ??? ?if(b[i].d==1)
?? ??? ?{
?? ??? ??? ?for(int j=0;j<i;j++)
?? ??? ??? ?{
?? ??? ??? ??? ?if(b[j].x<=b[i].x&&b[i].y>=b[j].y&&(b[i].y*b[j].y||b[i].x>b[j].x))
?? ??? ??? ??? ??? ?dp[i]=max(dp[i],dp[j]+b[i].z);
?? ??? ??? ?}
?? ??? ?}
?? ??? ?if(b[i].d==2)
?? ??? ?{
?? ??? ??? ?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);
?? ??? ??? ??? ?}
?? ??? ??? ?}
?? ??? ?}
?? ???? ans=max(ans,dp[i]); ?
?? ?}
?? ?cout<<ans<<'\n';
}

int main()
{
?? ?while(1)
?? ?{
?? ??? ?scanf("%d",&n);
?? ??? ?if(n==0)break;
?? ??? ?for(int i=0;i<n;i++)
?? ??? ?{
?? ??? ??? ?scanf("%d%d%d%d",&b[i].x,&b[i].y,&b[i].z,&b[i].d);
?? ??? ??? ?if(b[i].x<b[i].y)
?? ??? ??? ??? ?swap(b[i].x,b[i].y);
?? ??? ?}
?? ??? ?sort(b,b+n,cmp);
?? ??? ?DP();
?? ?}
?? ?return 0;
}

轉(zhuǎn)載于:https://www.cnblogs.com/benchao/p/4606309.html

總結(jié)

以上是生活随笔為你收集整理的积木(DP)问题的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。