uva437 巴比伦塔

AC Code

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <limits.h>
#include <queue>
#include <time.h>
#define inf 0x3f3f3f3f
#define maxn 1010
#define MOD 50000
using namespace std;
const double pi=acos(-1.0),ee=2.7182818284590452354;

int n,x[1000],y[1000],z[1000],e[1000][1000],f[1000];

int solve(int cur)
{
	if(f[cur]) return f[cur];
	f[cur]=z[cur];
	for(int i=1;i<=3*n;i++) 
		if(e[cur][i])
			f[cur]=max(f[cur],solve(i)+z[cur]);


	return f[cur];
}

int main(int argc, char** argv) {   
	int cas=0;       
	while(cin>>n,n){
		int i,j,maxx;
		cas++;
		
		for(i=1;i<=3*n;i+=3)
		{
			scanf("%d%d%d",&x[i],&y[i],&z[i]);
			z[i+1]=x[i];y[i+1]=y[i];x[i+1]=z[i];
			z[i+2]=y[i];y[i+2]=z[i];x[i+2]=x[i];
		}
		memset(e,0,sizeof(e));
		for(i=1;i<=3*n;i++)
			for(j=1;j<=3*n;j++)
			{
				if((x[i]>x[j]&&y[i]>y[j])||(x[i]>y[j]&&y[i]>x[j]))
					e[i][j]=1;
			}
		maxx=0;
		for(i=1;i<=3*n;i++)
		{
			memset(f,0,sizeof(f));
			maxx=max(maxx,solve(i));
		}
		cout<<"Case "<<cas<<": maximum height = "<<maxx<<endl;
	}
	 
	return 0;
}