hdu 1069 最长上升子序列变形

因为每种block都有无限多个，所以(x,y,z)等价于是(x,y,z)+(x,z,y)+(y,z,x)这三种block。

然后就像是矩形嵌套那样求解，只不过状态转移方程变成了：

　　dp[i] = max( dp[i], dp[j] + z[i] );

代码如下：

#include <algorithm>
#include <cstdio>
using namespace std;

const int N = 100;
int dp
;

struct Node
{
int x, y, z;
bool operator < ( const Node & o ) const
{
if ( x != o.x ) return x < o.x;
return y < o.y;
}
Node(){}
Node( int _x, int _y, int _z )
{
x = _x, y = _y, z = _z;
}
void standard()
{
if ( x > y ) swap( x, y );
}
} node
;

int main ()
{
int n, _case = 1;
while ( scanf("%d", &n), n )
{
for ( int i = 0; i < n; i++ )
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
node[i * 3] = Node( x, y, z );
node[i * 3].standard();
node[i * 3 + 1] = Node( x, z, y );
node[i * 3 + 1].standard();
node[i * 3 + 2] = Node( y, z, x );
node[i * 3 + 2].standard();
}
sort( node, node + 3 * n );
int ans = -1;
for ( int i = 0; i < 3 * n; i++ )
{
dp[i] = node[i].z;
for ( int j = 0; j < i; j++ )
{
if ( node[j].x < node[i].x && node[j].y < node[i].y )
{
dp[i] = max( dp[i], dp[j] + node[i].z );
}
}
ans = max( ans, dp[i] );
}
printf("Case %d: maximum height = %d\n", _case++, ans);
}
return 0;
}