dp之DAG算法

#include<bits/stdc++.h>
#define FER freopen("input.txt","r",stdin);
#define FEW freopen("output.txt","w",stdout);
using namespace std;
const int maxn=100;
int n,kase=0;
struct Cub
{
int x, y,h;
};
Cub cub[maxn];
int d[maxn],G[maxn][maxn],a[3],height;
void haveadge(int i,int j)
{
if ((cub[i].x>cub[j].x&&cub[i].y>cub[j].y)||(cub[i].x>cub[j].y&&cub[i].y>cub[j].x))
{
G[i][j]=1;
}
}
int dp(int i)
{
int &ans=d[i];
if (ans>0)
return ans;
ans=cub[i].h;
for (int j=0;j<3*n;j++)
{
if (G[i][j])
{
ans=max(ans,cub[i].h+dp(j));
}
}
return ans;
}
int main()
{
FER
FEW
while (scanf("%d",&n)&&n)
{
memset(G,0,sizeof(G));
memset(d,0,sizeof(d));
height=0;
for (int i=0;i<n;i++)
{
scanf("%d%d%d",&a[0],&a[1],&a[2]);
cub[3*i+0].x=a[0],cub[3*i+0].y=a[1],cub[3*i+0].h=a[2];
cub[3*i+1].x=a[0],cub[3*i+1].y=a[2],cub[3*i+1].h=a[1];
cub[3*i+2].x=a[2],cub[3*i+2].y=a[1],cub[3*i+2].h=a[0];
}
for (int i=0;i<3*n;i++)
{
for (int j=0;j<3*n;j++)
{
haveadge(i,j);
}
}
for (int i=0;i<3*n;i++)
dp(i);
for (int i=0;i<3*n;i++)
height=max(height,d[i]);
printf("Case %d: maximum height = %d\n",++kase,height);
}
return 0;
}

转载于:https://www.cnblogs.com/wantchange/p/11236129.html