标签：
C - Monkey and Banana
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU 1069Case 4: maximum height = 342
刚开始学动态规划，还是挺难的，我参考了这位大神的思路
dp[i]:表示以p[i]这个长方体放在顶端，可以获得最大的高度。
那么状态转移是，DP[i]=max( dp[i], p[i].high + dp[j] )
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<bits/stdc++.h>
using namespace std;
template<class T>inline T read(T&x)
{
char c;
while((c=getchar())<=32)if(c==EOF)return 0;
bool ok=false;
if(c=='-')ok=true,c=getchar();
for(x=0; c>32; c=getchar())
x=x*10+c-'0';
if(ok)x=-x;
return 1;
}
template<class T> inline T read_(T&x,T&y)
{
return read(x)&&read(y);
}
template<class T> inline T read__(T&x,T&y,T&z)
{
return read(x)&&read(y)&&read(z);
}
template<class T> inline void write(T x)
{
if(x<0)putchar('-'),x=-x;
if(x<10)putchar(x+'0');
else write(x/10),putchar(x%10+'0');
}
template<class T>inline void writeln(T x)
{
write(x);
putchar('\n');
}
//-------ZCC IO template------
const int maxn=400;
const double inf=999999999;
#define lson (rt<<1),L,M
#define rson (rt<<1|1),M+1,R
#define M ((L+R)>>1)
#define For(i,t,n) for(int i=(t);i<(n);i++)
typedef long long LL;
typedef double DB;
typedef pair<int,int> P;
#define bug printf("---\n");
#define mod 1000000007
struct node
{
int width,length,area,high;
bool operator<(const node&a) const
{
return area>a.area;
}
}p[maxn];
int dp[maxn];
int main()
{
int n,m,i,j,t,k;
int cas=1;
while(read(n)&&n)
{
k=0;
For(i,0,n)
{
int w,l,h;
read__(w,l,h);
node tmp;
tmp.width=w;tmp.length=l;tmp.high=h;
tmp.area=w*l;
p[k++]=tmp;
tmp.width=w;tmp.length=h;tmp.high=l;
tmp.area=w*h;
p[k++]=tmp;
tmp.width=h;tmp.length=l;tmp.high=w;
tmp.area=h*l;
p[k++]=tmp;
}
sort(p,p+k);
dp[0]=p[0].high;
for(i=1;i<k;i++)
{
dp[i]=p[i].high;
for(j=0;j<i;j++)if(p[j].width>p[i].width&&p[j].length>p[i].length||p[j].width>p[i].length&&p[j].length>p[i].width)
{
dp[i]=max(dp[i],dp[j]+p[i].high);
}
}
// For(i,0,k)
// printf("dp[%d] = %d\n",i,dp[i]);
printf("Case %d: maximum height = %d\n",cas++,*max_element(dp,dp+k));
}
return 0;
}C - Monkey and Banana HDU 1069( 动态规划+叠放长方体)
标签：
原文地址：http://blog.csdn.net/u013167299/article/details/45102725
